TSTP Solution File: SEU229+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SEU229+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n009.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:35 EDT 2023
% Result : Theorem 162.69s 162.86s
% Output : CNFRefutation 162.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 27
% Syntax : Number of formulae : 54 ( 7 unt; 24 typ; 0 def)
% Number of atoms : 107 ( 51 equ)
% Maximal formula atoms : 28 ( 3 avg)
% Number of connectives : 130 ( 53 ~; 56 |; 19 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 19 ( 11 >; 8 *; 0 +; 0 <<)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 13 con; 0-4 aty)
% Number of variables : 87 ( 12 sgn; 28 !; 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,
unordered_triple: ( $i * $i * $i ) > $i ).
tff(decl_28,type,
element: ( $i * $i ) > $o ).
tff(decl_29,type,
empty_set: $i ).
tff(decl_30,type,
relation_empty_yielding: $i > $o ).
tff(decl_31,type,
esk1_4: ( $i * $i * $i * $i ) > $i ).
tff(decl_32,type,
esk2_1: $i > $i ).
tff(decl_33,type,
esk3_0: $i ).
tff(decl_34,type,
esk4_0: $i ).
tff(decl_35,type,
esk5_0: $i ).
tff(decl_36,type,
esk6_0: $i ).
tff(decl_37,type,
esk7_0: $i ).
tff(decl_38,type,
esk8_0: $i ).
tff(decl_39,type,
esk9_0: $i ).
tff(decl_40,type,
esk10_0: $i ).
tff(decl_41,type,
esk11_0: $i ).
tff(decl_42,type,
esk12_0: $i ).
tff(decl_43,type,
esk13_0: $i ).
tff(decl_44,type,
esk14_0: $i ).
tff(decl_45,type,
esk15_2: ( $i * $i ) > $i ).
fof(d1_enumset1,axiom,
! [X1,X2,X3,X4] :
( X4 = unordered_triple(X1,X2,X3)
<=> ! [X5] :
( in(X5,X4)
<=> ~ ( X5 != X1
& X5 != X2
& X5 != X3 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_enumset1) ).
fof(t7_tarski,axiom,
! [X1,X2] :
~ ( in(X1,X2)
& ! [X3] :
~ ( in(X3,X2)
& ! [X4] :
~ ( in(X4,X2)
& in(X4,X3) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t7_tarski) ).
fof(t3_ordinal1,conjecture,
! [X1,X2,X3] :
~ ( in(X1,X2)
& in(X2,X3)
& in(X3,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_ordinal1) ).
fof(c_0_3,plain,
! [X11,X12,X13,X14,X15,X16,X17,X18,X19,X20] :
( ( ~ in(X15,X14)
| X15 = X11
| X15 = X12
| X15 = X13
| X14 != unordered_triple(X11,X12,X13) )
& ( X16 != X11
| in(X16,X14)
| X14 != unordered_triple(X11,X12,X13) )
& ( X16 != X12
| in(X16,X14)
| X14 != unordered_triple(X11,X12,X13) )
& ( X16 != X13
| in(X16,X14)
| X14 != unordered_triple(X11,X12,X13) )
& ( esk1_4(X17,X18,X19,X20) != X17
| ~ in(esk1_4(X17,X18,X19,X20),X20)
| X20 = unordered_triple(X17,X18,X19) )
& ( esk1_4(X17,X18,X19,X20) != X18
| ~ in(esk1_4(X17,X18,X19,X20),X20)
| X20 = unordered_triple(X17,X18,X19) )
& ( esk1_4(X17,X18,X19,X20) != X19
| ~ in(esk1_4(X17,X18,X19,X20),X20)
| X20 = unordered_triple(X17,X18,X19) )
& ( in(esk1_4(X17,X18,X19,X20),X20)
| esk1_4(X17,X18,X19,X20) = X17
| esk1_4(X17,X18,X19,X20) = X18
| esk1_4(X17,X18,X19,X20) = X19
| X20 = unordered_triple(X17,X18,X19) ) ),
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)],[d1_enumset1])])])])])]) ).
cnf(c_0_4,plain,
( X1 = X3
| X1 = X4
| X1 = X5
| ~ in(X1,X2)
| X2 != unordered_triple(X3,X4,X5) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
fof(c_0_5,plain,
! [X43,X44,X46] :
( ( in(esk15_2(X43,X44),X44)
| ~ in(X43,X44) )
& ( ~ in(X46,X44)
| ~ in(X46,esk15_2(X43,X44))
| ~ in(X43,X44) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t7_tarski])])])])]) ).
cnf(c_0_6,plain,
( X1 = X2
| X1 = X3
| X1 = X4
| ~ in(X1,unordered_triple(X4,X3,X2)) ),
inference(er,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( in(esk15_2(X1,X2),X2)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( in(X1,X3)
| X1 != X2
| X3 != unordered_triple(X2,X4,X5) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_9,plain,
( esk15_2(X1,unordered_triple(X2,X3,X4)) = X4
| esk15_2(X1,unordered_triple(X2,X3,X4)) = X3
| esk15_2(X1,unordered_triple(X2,X3,X4)) = X2
| ~ in(X1,unordered_triple(X2,X3,X4)) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,plain,
in(X1,unordered_triple(X1,X2,X3)),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_8])]) ).
cnf(c_0_11,plain,
( ~ in(X1,X2)
| ~ in(X1,esk15_2(X3,X2))
| ~ in(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_12,plain,
( esk15_2(X1,unordered_triple(X1,X2,X3)) = X1
| esk15_2(X1,unordered_triple(X1,X2,X3)) = X2
| esk15_2(X1,unordered_triple(X1,X2,X3)) = X3 ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
fof(c_0_13,negated_conjecture,
~ ! [X1,X2,X3] :
~ ( in(X1,X2)
& in(X2,X3)
& in(X3,X1) ),
inference(assume_negation,[status(cth)],[t3_ordinal1]) ).
cnf(c_0_14,plain,
( esk15_2(X1,unordered_triple(X1,X2,X3)) = X2
| esk15_2(X1,unordered_triple(X1,X2,X3)) = X1
| ~ in(X4,unordered_triple(X1,X2,X3))
| ~ in(X4,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_10])]) ).
fof(c_0_15,negated_conjecture,
( in(esk12_0,esk13_0)
& in(esk13_0,esk14_0)
& in(esk14_0,esk12_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])]) ).
cnf(c_0_16,plain,
( esk15_2(X1,unordered_triple(X1,X2,X3)) = X1
| esk15_2(X1,unordered_triple(X1,X2,X3)) = X2
| ~ in(X1,X3) ),
inference(spm,[status(thm)],[c_0_14,c_0_10]) ).
cnf(c_0_17,negated_conjecture,
in(esk14_0,esk12_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_18,negated_conjecture,
( esk15_2(esk14_0,unordered_triple(esk14_0,X1,esk12_0)) = esk14_0
| esk15_2(esk14_0,unordered_triple(esk14_0,X1,esk12_0)) = X1 ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_19,plain,
( in(X1,X3)
| X1 != X2
| X3 != unordered_triple(X4,X2,X5) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_20,negated_conjecture,
( esk15_2(esk14_0,unordered_triple(esk14_0,X1,esk12_0)) = X1
| ~ in(X2,unordered_triple(esk14_0,X1,esk12_0))
| ~ in(X2,esk14_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_18]),c_0_10])]) ).
cnf(c_0_21,plain,
in(X1,unordered_triple(X2,X1,X3)),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_19])]) ).
cnf(c_0_22,negated_conjecture,
( esk15_2(esk14_0,unordered_triple(esk14_0,X1,esk12_0)) = X1
| ~ in(X1,esk14_0) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_23,plain,
( in(X1,X3)
| X1 != X2
| X3 != unordered_triple(X4,X5,X2) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_24,negated_conjecture,
( ~ in(X1,unordered_triple(esk14_0,X2,esk12_0))
| ~ in(X2,esk14_0)
| ~ in(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_22]),c_0_10])]) ).
cnf(c_0_25,plain,
in(X1,unordered_triple(X2,X3,X1)),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_23])]) ).
cnf(c_0_26,negated_conjecture,
( ~ in(X1,esk14_0)
| ~ in(esk12_0,X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_27,negated_conjecture,
in(esk13_0,esk14_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_28,negated_conjecture,
in(esk12_0,esk13_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU229+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.12/0.34 % Computer : n009.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Wed Aug 23 20:20:21 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.19/0.55 start to proof: theBenchmark
% 162.69/162.86 % Version : CSE_E---1.5
% 162.69/162.86 % Problem : theBenchmark.p
% 162.69/162.86 % Proof found
% 162.69/162.86 % SZS status Theorem for theBenchmark.p
% 162.69/162.86 % SZS output start Proof
% See solution above
% 162.69/162.86 % Total time : 162.314000 s
% 162.84/162.86 % SZS output end Proof
% 162.84/162.86 % Total time : 162.324000 s
%------------------------------------------------------------------------------