TSTP Solution File: SEU219+3 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SEU219+3 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n014.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Aug 31 16:23:28 EDT 2023
% Result : Theorem 0.19s 0.58s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 29
% Syntax : Number of formulae : 43 ( 5 unt; 26 typ; 0 def)
% Number of atoms : 47 ( 20 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 48 ( 18 ~; 13 |; 10 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 19 ( 16 >; 3 *; 0 +; 0 <<)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 18 ( 18 usr; 10 con; 0-1 aty)
% Number of variables : 9 ( 0 sgn; 6 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
in: ( $i * $i ) > $o ).
tff(decl_23,type,
empty: $i > $o ).
tff(decl_24,type,
function: $i > $o ).
tff(decl_25,type,
relation: $i > $o ).
tff(decl_26,type,
one_to_one: $i > $o ).
tff(decl_27,type,
function_inverse: $i > $i ).
tff(decl_28,type,
relation_inverse: $i > $i ).
tff(decl_29,type,
element: ( $i * $i ) > $o ).
tff(decl_30,type,
empty_set: $i ).
tff(decl_31,type,
relation_empty_yielding: $i > $o ).
tff(decl_32,type,
powerset: $i > $i ).
tff(decl_33,type,
relation_dom: $i > $i ).
tff(decl_34,type,
relation_rng: $i > $i ).
tff(decl_35,type,
subset: ( $i * $i ) > $o ).
tff(decl_36,type,
esk1_1: $i > $i ).
tff(decl_37,type,
esk2_0: $i ).
tff(decl_38,type,
esk3_0: $i ).
tff(decl_39,type,
esk4_1: $i > $i ).
tff(decl_40,type,
esk5_0: $i ).
tff(decl_41,type,
esk6_0: $i ).
tff(decl_42,type,
esk7_0: $i ).
tff(decl_43,type,
esk8_1: $i > $i ).
tff(decl_44,type,
esk9_0: $i ).
tff(decl_45,type,
esk10_0: $i ).
tff(decl_46,type,
esk11_0: $i ).
tff(decl_47,type,
esk12_0: $i ).
fof(t55_funct_1,conjecture,
! [X1] :
( ( relation(X1)
& function(X1) )
=> ( one_to_one(X1)
=> ( relation_rng(X1) = relation_dom(function_inverse(X1))
& relation_dom(X1) = relation_rng(function_inverse(X1)) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t55_funct_1) ).
fof(d9_funct_1,axiom,
! [X1] :
( ( relation(X1)
& function(X1) )
=> ( one_to_one(X1)
=> function_inverse(X1) = relation_inverse(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d9_funct_1) ).
fof(t37_relat_1,axiom,
! [X1] :
( relation(X1)
=> ( relation_rng(X1) = relation_dom(relation_inverse(X1))
& relation_dom(X1) = relation_rng(relation_inverse(X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t37_relat_1) ).
fof(c_0_3,negated_conjecture,
~ ! [X1] :
( ( relation(X1)
& function(X1) )
=> ( one_to_one(X1)
=> ( relation_rng(X1) = relation_dom(function_inverse(X1))
& relation_dom(X1) = relation_rng(function_inverse(X1)) ) ) ),
inference(assume_negation,[status(cth)],[t55_funct_1]) ).
fof(c_0_4,negated_conjecture,
( relation(esk12_0)
& function(esk12_0)
& one_to_one(esk12_0)
& ( relation_rng(esk12_0) != relation_dom(function_inverse(esk12_0))
| relation_dom(esk12_0) != relation_rng(function_inverse(esk12_0)) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
fof(c_0_5,plain,
! [X9] :
( ~ relation(X9)
| ~ function(X9)
| ~ one_to_one(X9)
| function_inverse(X9) = relation_inverse(X9) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d9_funct_1])]) ).
cnf(c_0_6,negated_conjecture,
( relation_rng(esk12_0) != relation_dom(function_inverse(esk12_0))
| relation_dom(esk12_0) != relation_rng(function_inverse(esk12_0)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( function_inverse(X1) = relation_inverse(X1)
| ~ relation(X1)
| ~ function(X1)
| ~ one_to_one(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
one_to_one(esk12_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_9,negated_conjecture,
relation(esk12_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_10,negated_conjecture,
function(esk12_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_11,plain,
! [X39] :
( ( relation_rng(X39) = relation_dom(relation_inverse(X39))
| ~ relation(X39) )
& ( relation_dom(X39) = relation_rng(relation_inverse(X39))
| ~ relation(X39) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t37_relat_1])])]) ).
cnf(c_0_12,negated_conjecture,
( relation_rng(relation_inverse(esk12_0)) != relation_dom(esk12_0)
| relation_dom(relation_inverse(esk12_0)) != relation_rng(esk12_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]),c_0_9]),c_0_10])]) ).
cnf(c_0_13,plain,
( relation_dom(X1) = relation_rng(relation_inverse(X1))
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_14,negated_conjecture,
relation_dom(relation_inverse(esk12_0)) != relation_rng(esk12_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_9])]) ).
cnf(c_0_15,plain,
( relation_rng(X1) = relation_dom(relation_inverse(X1))
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_9])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU219+3 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.12 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.15/0.34 % Computer : n014.cluster.edu
% 0.15/0.34 % Model : x86_64 x86_64
% 0.15/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34 % Memory : 8042.1875MB
% 0.15/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.34 % CPULimit : 300
% 0.15/0.34 % WCLimit : 300
% 0.15/0.34 % DateTime : Wed Aug 23 18:11:04 EDT 2023
% 0.15/0.34 % CPUTime :
% 0.19/0.56 start to proof: theBenchmark
% 0.19/0.58 % Version : CSE_E---1.5
% 0.19/0.58 % Problem : theBenchmark.p
% 0.19/0.58 % Proof found
% 0.19/0.58 % SZS status Theorem for theBenchmark.p
% 0.19/0.58 % SZS output start Proof
% See solution above
% 0.19/0.59 % Total time : 0.012000 s
% 0.19/0.59 % SZS output end Proof
% 0.19/0.59 % Total time : 0.015000 s
%------------------------------------------------------------------------------