TSTP Solution File: SEU145+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU145+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n012.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 : 600s
% DateTime : Tue Jul 19 09:17:07 EDT 2022
% Result : Theorem 0.23s 1.41s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 4
% Syntax : Number of formulae : 58 ( 10 unt; 0 def)
% Number of atoms : 164 ( 54 equ)
% Maximal formula atoms : 20 ( 2 avg)
% Number of connectives : 168 ( 62 ~; 85 |; 13 &)
% ( 5 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-3 aty)
% Number of variables : 125 ( 14 sgn 35 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d4_xboole_0,axiom,
! [X1,X2,X3] :
( X3 = set_difference(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( in(X4,X1)
& ~ in(X4,X2) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d4_xboole_0) ).
fof(d1_tarski,axiom,
! [X1,X2] :
( X2 = singleton(X1)
<=> ! [X3] :
( in(X3,X2)
<=> X3 = X1 ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d1_tarski) ).
fof(l3_zfmisc_1,conjecture,
! [X1,X2,X3] :
( subset(X1,X2)
=> ( in(X3,X1)
| subset(X1,set_difference(X2,singleton(X3))) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',l3_zfmisc_1) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d3_tarski) ).
fof(c_0_4,plain,
! [X5,X6,X7,X8,X8,X5,X6,X7] :
( ( in(X8,X5)
| ~ in(X8,X7)
| X7 != set_difference(X5,X6) )
& ( ~ in(X8,X6)
| ~ in(X8,X7)
| X7 != set_difference(X5,X6) )
& ( ~ in(X8,X5)
| in(X8,X6)
| in(X8,X7)
| X7 != set_difference(X5,X6) )
& ( ~ in(esk3_3(X5,X6,X7),X7)
| ~ in(esk3_3(X5,X6,X7),X5)
| in(esk3_3(X5,X6,X7),X6)
| X7 = set_difference(X5,X6) )
& ( in(esk3_3(X5,X6,X7),X5)
| in(esk3_3(X5,X6,X7),X7)
| X7 = set_difference(X5,X6) )
& ( ~ in(esk3_3(X5,X6,X7),X6)
| in(esk3_3(X5,X6,X7),X7)
| X7 = set_difference(X5,X6) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[d4_xboole_0])])])])])])])]) ).
fof(c_0_5,plain,
! [X4,X5,X6,X6,X4,X5] :
( ( ~ in(X6,X5)
| X6 = X4
| X5 != singleton(X4) )
& ( X6 != X4
| in(X6,X5)
| X5 != singleton(X4) )
& ( ~ in(esk1_2(X4,X5),X5)
| esk1_2(X4,X5) != X4
| X5 = singleton(X4) )
& ( in(esk1_2(X4,X5),X5)
| esk1_2(X4,X5) = X4
| X5 = singleton(X4) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d1_tarski])])])])])])]) ).
fof(c_0_6,negated_conjecture,
~ ! [X1,X2,X3] :
( subset(X1,X2)
=> ( in(X3,X1)
| subset(X1,set_difference(X2,singleton(X3))) ) ),
inference(assume_negation,[status(cth)],[l3_zfmisc_1]) ).
cnf(c_0_7,plain,
( X1 = set_difference(X2,X3)
| in(esk3_3(X2,X3,X1),X1)
| ~ in(esk3_3(X2,X3,X1),X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
( X1 = set_difference(X2,X3)
| in(esk3_3(X2,X3,X1),X1)
| in(esk3_3(X2,X3,X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_9,plain,
( X1 != set_difference(X2,X3)
| ~ in(X4,X1)
| ~ in(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_10,plain,
( in(X3,X1)
| X1 != singleton(X2)
| X3 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_11,plain,
! [X4,X5,X6,X4,X5] :
( ( ~ subset(X4,X5)
| ~ in(X6,X4)
| in(X6,X5) )
& ( in(esk2_2(X4,X5),X4)
| subset(X4,X5) )
& ( ~ in(esk2_2(X4,X5),X5)
| subset(X4,X5) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d3_tarski])])])])])])]) ).
fof(c_0_12,negated_conjecture,
( subset(esk4_0,esk5_0)
& ~ in(esk6_0,esk4_0)
& ~ subset(esk4_0,set_difference(esk5_0,singleton(esk6_0))) ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).
cnf(c_0_13,plain,
( X3 = X2
| X1 != singleton(X2)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_14,plain,
( X1 = set_difference(X2,X2)
| in(esk3_3(X2,X2,X1),X1) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_15,plain,
( ~ in(X1,set_difference(X2,X3))
| ~ in(X1,X3) ),
inference(er,[status(thm)],[c_0_9]) ).
cnf(c_0_16,plain,
( in(X1,X2)
| X2 != singleton(X1) ),
inference(er,[status(thm)],[c_0_10]) ).
cnf(c_0_17,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,negated_conjecture,
subset(esk4_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
( subset(X1,X2)
| in(esk2_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_20,plain,
( X1 = set_difference(X2,X3)
| in(esk3_3(X2,X3,X1),X3)
| ~ in(esk3_3(X2,X3,X1),X2)
| ~ in(esk3_3(X2,X3,X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_21,plain,
( set_difference(X1,X2) = X1
| in(esk3_3(X1,X2,X1),X1) ),
inference(ef,[status(thm)],[c_0_8]) ).
cnf(c_0_22,plain,
( X1 = esk3_3(X2,X2,X3)
| X3 = set_difference(X2,X2)
| X3 != singleton(X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_23,plain,
( set_difference(X1,X2) != singleton(X3)
| ~ in(X3,X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_24,plain,
( subset(X1,X2)
| ~ in(esk2_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_25,negated_conjecture,
( in(X1,esk5_0)
| ~ in(X1,esk4_0) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_26,plain,
( X1 = esk2_2(X2,X3)
| subset(X2,X3)
| X2 != singleton(X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_19]) ).
cnf(c_0_27,plain,
( set_difference(X1,X2) = X1
| in(esk3_3(X1,X2,X1),X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_21]) ).
cnf(c_0_28,plain,
( X1 = set_difference(X2,X3)
| in(esk3_3(X2,X3,X1),X1)
| singleton(esk3_3(X2,X3,X1)) != X3 ),
inference(spm,[status(thm)],[c_0_7,c_0_16]) ).
cnf(c_0_29,plain,
( esk3_3(X1,X1,singleton(X2)) = X2
| singleton(X2) = set_difference(X1,X1) ),
inference(er,[status(thm)],[c_0_22]) ).
cnf(c_0_30,plain,
( set_difference(X1,X2) != singleton(X3)
| X2 != singleton(X3) ),
inference(spm,[status(thm)],[c_0_23,c_0_16]) ).
cnf(c_0_31,negated_conjecture,
( subset(X1,esk5_0)
| ~ in(esk2_2(X1,esk5_0),esk4_0) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_32,plain,
( esk2_2(singleton(X1),X2) = X1
| subset(singleton(X1),X2) ),
inference(er,[status(thm)],[c_0_26]) ).
cnf(c_0_33,plain,
( X1 = esk3_3(X2,X3,X2)
| set_difference(X2,X3) = X2
| X3 != singleton(X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_27]) ).
cnf(c_0_34,plain,
( in(X1,singleton(X1))
| singleton(X1) != X2 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]) ).
cnf(c_0_35,negated_conjecture,
( subset(singleton(X1),esk5_0)
| ~ in(X1,esk4_0) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_36,plain,
( esk3_3(X1,singleton(X2),X1) = X2
| set_difference(X1,singleton(X2)) = X1 ),
inference(er,[status(thm)],[c_0_33]) ).
cnf(c_0_37,plain,
in(X1,singleton(X1)),
inference(er,[status(thm)],[c_0_34]) ).
cnf(c_0_38,negated_conjecture,
( subset(singleton(esk2_2(esk4_0,X1)),esk5_0)
| subset(esk4_0,X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_19]) ).
cnf(c_0_39,negated_conjecture,
~ subset(esk4_0,set_difference(esk5_0,singleton(esk6_0))),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_40,plain,
( set_difference(X1,singleton(X2)) = X1
| in(X2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_36]),c_0_37])]) ).
cnf(c_0_41,plain,
( in(X4,X1)
| in(X4,X3)
| X1 != set_difference(X2,X3)
| ~ in(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_42,negated_conjecture,
( subset(esk4_0,X1)
| in(X2,esk5_0)
| ~ in(X2,singleton(esk2_2(esk4_0,X1))) ),
inference(spm,[status(thm)],[c_0_17,c_0_38]) ).
cnf(c_0_43,plain,
( subset(singleton(X1),X2)
| ~ in(X1,X2) ),
inference(spm,[status(thm)],[c_0_24,c_0_32]) ).
cnf(c_0_44,negated_conjecture,
in(esk6_0,esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_18])]) ).
cnf(c_0_45,plain,
( in(X1,set_difference(X2,X3))
| in(X1,X3)
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_41]) ).
cnf(c_0_46,negated_conjecture,
( subset(esk4_0,X1)
| in(X2,esk5_0)
| singleton(esk2_2(esk4_0,X1)) != singleton(X2) ),
inference(spm,[status(thm)],[c_0_42,c_0_16]) ).
cnf(c_0_47,negated_conjecture,
subset(singleton(esk6_0),esk5_0),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_48,plain,
( subset(X1,set_difference(X2,X3))
| in(esk2_2(X1,set_difference(X2,X3)),X3)
| ~ in(esk2_2(X1,set_difference(X2,X3)),X2) ),
inference(spm,[status(thm)],[c_0_24,c_0_45]) ).
cnf(c_0_49,negated_conjecture,
( subset(esk4_0,X1)
| in(esk2_2(esk4_0,X1),esk5_0) ),
inference(er,[status(thm)],[c_0_46]) ).
cnf(c_0_50,negated_conjecture,
( in(X1,esk5_0)
| ~ in(X1,singleton(esk6_0)) ),
inference(spm,[status(thm)],[c_0_17,c_0_47]) ).
cnf(c_0_51,negated_conjecture,
( subset(esk4_0,set_difference(esk5_0,X1))
| in(esk2_2(esk4_0,set_difference(esk5_0,X1)),X1) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_52,negated_conjecture,
in(esk2_2(esk4_0,set_difference(esk5_0,singleton(esk6_0))),esk5_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_39]) ).
cnf(c_0_53,negated_conjecture,
in(esk2_2(esk4_0,set_difference(esk5_0,singleton(esk6_0))),singleton(esk6_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_52]),c_0_39]) ).
cnf(c_0_54,negated_conjecture,
( X1 = esk2_2(esk4_0,set_difference(esk5_0,singleton(esk6_0)))
| singleton(esk6_0) != singleton(X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_53]) ).
cnf(c_0_55,negated_conjecture,
esk2_2(esk4_0,set_difference(esk5_0,singleton(esk6_0))) = esk6_0,
inference(er,[status(thm)],[c_0_54]) ).
cnf(c_0_56,negated_conjecture,
~ in(esk6_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_57,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_55]),c_0_39]),c_0_56]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU145+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.13/0.33 % Computer : n012.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sun Jun 19 07:59:08 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.23/1.41 # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 0.23/1.41 # Preprocessing time : 0.015 s
% 0.23/1.41
% 0.23/1.41 # Proof found!
% 0.23/1.41 # SZS status Theorem
% 0.23/1.41 # SZS output start CNFRefutation
% See solution above
% 0.23/1.41 # Proof object total steps : 58
% 0.23/1.41 # Proof object clause steps : 49
% 0.23/1.41 # Proof object formula steps : 9
% 0.23/1.41 # Proof object conjectures : 22
% 0.23/1.41 # Proof object clause conjectures : 19
% 0.23/1.41 # Proof object formula conjectures : 3
% 0.23/1.41 # Proof object initial clauses used : 13
% 0.23/1.41 # Proof object initial formulas used : 4
% 0.23/1.41 # Proof object generating inferences : 35
% 0.23/1.41 # Proof object simplifying inferences : 11
% 0.23/1.41 # Training examples: 0 positive, 0 negative
% 0.23/1.41 # Parsed axioms : 8
% 0.23/1.41 # Removed by relevancy pruning/SinE : 0
% 0.23/1.41 # Initial clauses : 20
% 0.23/1.41 # Removed in clause preprocessing : 2
% 0.23/1.41 # Initial clauses in saturation : 18
% 0.23/1.41 # Processed clauses : 1140
% 0.23/1.41 # ...of these trivial : 10
% 0.23/1.41 # ...subsumed : 606
% 0.23/1.41 # ...remaining for further processing : 524
% 0.23/1.41 # Other redundant clauses eliminated : 8
% 0.23/1.41 # Clauses deleted for lack of memory : 0
% 0.23/1.41 # Backward-subsumed : 14
% 0.23/1.41 # Backward-rewritten : 44
% 0.23/1.41 # Generated clauses : 6494
% 0.23/1.41 # ...of the previous two non-trivial : 6243
% 0.23/1.41 # Contextual simplify-reflections : 385
% 0.23/1.41 # Paramodulations : 6376
% 0.23/1.41 # Factorizations : 46
% 0.23/1.41 # Equation resolutions : 63
% 0.23/1.41 # Current number of processed clauses : 462
% 0.23/1.41 # Positive orientable unit clauses : 13
% 0.23/1.41 # Positive unorientable unit clauses: 0
% 0.23/1.41 # Negative unit clauses : 19
% 0.23/1.41 # Non-unit-clauses : 430
% 0.23/1.41 # Current number of unprocessed clauses: 4901
% 0.23/1.41 # ...number of literals in the above : 18094
% 0.23/1.41 # Current number of archived formulas : 0
% 0.23/1.41 # Current number of archived clauses : 58
% 0.23/1.41 # Clause-clause subsumption calls (NU) : 43429
% 0.23/1.41 # Rec. Clause-clause subsumption calls : 27556
% 0.23/1.41 # Non-unit clause-clause subsumptions : 877
% 0.23/1.41 # Unit Clause-clause subsumption calls : 2092
% 0.23/1.41 # Rewrite failures with RHS unbound : 0
% 0.23/1.41 # BW rewrite match attempts : 66
% 0.23/1.41 # BW rewrite match successes : 9
% 0.23/1.41 # Condensation attempts : 0
% 0.23/1.41 # Condensation successes : 0
% 0.23/1.41 # Termbank termtop insertions : 111312
% 0.23/1.41
% 0.23/1.41 # -------------------------------------------------
% 0.23/1.41 # User time : 0.156 s
% 0.23/1.41 # System time : 0.002 s
% 0.23/1.41 # Total time : 0.158 s
% 0.23/1.41 # Maximum resident set size: 8052 pages
% 0.23/23.41 eprover: CPU time limit exceeded, terminating
% 0.23/23.42 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.42 eprover: No such file or directory
% 0.23/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.43 eprover: No such file or directory
% 0.23/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.43 eprover: No such file or directory
% 0.23/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.43 eprover: No such file or directory
% 0.23/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.44 eprover: No such file or directory
% 0.23/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.44 eprover: No such file or directory
% 0.23/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.44 eprover: No such file or directory
% 0.23/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.45 eprover: No such file or directory
% 0.23/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.45 eprover: No such file or directory
% 0.23/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.45 eprover: No such file or directory
% 0.23/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.46 eprover: No such file or directory
%------------------------------------------------------------------------------