TSTP Solution File: SEU151+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SEU151+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n015.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:22:49 EDT 2023
% Result : Theorem 0.20s 0.64s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of formulae : 28 ( 11 unt; 7 typ; 0 def)
% Number of atoms : 59 ( 42 equ)
% Maximal formula atoms : 20 ( 2 avg)
% Number of connectives : 67 ( 29 ~; 25 |; 11 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 7 ( 3 >; 4 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-3 aty)
% Number of variables : 40 ( 4 sgn; 20 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
in: ( $i * $i ) > $o ).
tff(decl_23,type,
unordered_pair: ( $i * $i ) > $i ).
tff(decl_24,type,
esk1_3: ( $i * $i * $i ) > $i ).
tff(decl_25,type,
esk2_0: $i ).
tff(decl_26,type,
esk3_0: $i ).
tff(decl_27,type,
esk4_0: $i ).
tff(decl_28,type,
esk5_0: $i ).
fof(d2_tarski,axiom,
! [X1,X2,X3] :
( X3 = unordered_pair(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( X4 = X1
| X4 = X2 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_tarski) ).
fof(t10_zfmisc_1,conjecture,
! [X1,X2,X3,X4] :
~ ( unordered_pair(X1,X2) = unordered_pair(X3,X4)
& X1 != X3
& X1 != X4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t10_zfmisc_1) ).
fof(c_0_2,plain,
! [X9,X10,X11,X12,X13,X14,X15,X16] :
( ( ~ in(X12,X11)
| X12 = X9
| X12 = X10
| X11 != unordered_pair(X9,X10) )
& ( X13 != X9
| in(X13,X11)
| X11 != unordered_pair(X9,X10) )
& ( X13 != X10
| in(X13,X11)
| X11 != unordered_pair(X9,X10) )
& ( esk1_3(X14,X15,X16) != X14
| ~ in(esk1_3(X14,X15,X16),X16)
| X16 = unordered_pair(X14,X15) )
& ( esk1_3(X14,X15,X16) != X15
| ~ in(esk1_3(X14,X15,X16),X16)
| X16 = unordered_pair(X14,X15) )
& ( in(esk1_3(X14,X15,X16),X16)
| esk1_3(X14,X15,X16) = X14
| esk1_3(X14,X15,X16) = X15
| X16 = unordered_pair(X14,X15) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d2_tarski])])])])])]) ).
fof(c_0_3,negated_conjecture,
~ ! [X1,X2,X3,X4] :
~ ( unordered_pair(X1,X2) = unordered_pair(X3,X4)
& X1 != X3
& X1 != X4 ),
inference(assume_negation,[status(cth)],[t10_zfmisc_1]) ).
cnf(c_0_4,plain,
( in(X1,X3)
| X1 != X2
| X3 != unordered_pair(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
fof(c_0_5,negated_conjecture,
( unordered_pair(esk2_0,esk3_0) = unordered_pair(esk4_0,esk5_0)
& esk2_0 != esk4_0
& esk2_0 != esk5_0 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
cnf(c_0_6,plain,
( in(X1,X3)
| X1 != X2
| X3 != unordered_pair(X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_7,plain,
( X1 = X3
| X1 = X4
| ~ in(X1,X2)
| X2 != unordered_pair(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_8,plain,
in(X1,unordered_pair(X2,X1)),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_4])]) ).
cnf(c_0_9,negated_conjecture,
unordered_pair(esk2_0,esk3_0) = unordered_pair(esk4_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,plain,
in(X1,unordered_pair(X1,X2)),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_6])]) ).
cnf(c_0_11,plain,
( X1 = X2
| X1 = X3
| ~ in(X1,unordered_pair(X3,X2)) ),
inference(er,[status(thm)],[c_0_7]) ).
cnf(c_0_12,negated_conjecture,
in(esk5_0,unordered_pair(esk2_0,esk3_0)),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,negated_conjecture,
esk2_0 != esk5_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_14,negated_conjecture,
in(esk4_0,unordered_pair(esk2_0,esk3_0)),
inference(spm,[status(thm)],[c_0_10,c_0_9]) ).
cnf(c_0_15,negated_conjecture,
esk2_0 != esk4_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_16,negated_conjecture,
esk3_0 = esk5_0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).
cnf(c_0_17,negated_conjecture,
esk5_0 = esk4_0,
inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_14]),c_0_15]),c_0_16]) ).
cnf(c_0_18,negated_conjecture,
unordered_pair(esk4_0,esk4_0) = unordered_pair(esk2_0,esk4_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_16]),c_0_17]),c_0_17]) ).
cnf(c_0_19,negated_conjecture,
( X1 = esk4_0
| ~ in(X1,unordered_pair(esk2_0,esk4_0)) ),
inference(spm,[status(thm)],[c_0_11,c_0_18]) ).
cnf(c_0_20,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_10]),c_0_15]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SEU151+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.14 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.14/0.35 % Computer : n015.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Wed Aug 23 13:34:04 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.63 start to proof: theBenchmark
% 0.20/0.64 % Version : CSE_E---1.5
% 0.20/0.64 % Problem : theBenchmark.p
% 0.20/0.64 % Proof found
% 0.20/0.64 % SZS status Theorem for theBenchmark.p
% 0.20/0.64 % SZS output start Proof
% See solution above
% 0.20/0.64 % Total time : 0.006000 s
% 0.20/0.64 % SZS output end Proof
% 0.20/0.64 % Total time : 0.008000 s
%------------------------------------------------------------------------------