TSTP Solution File: SEU154+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU154+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n008.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:13 EDT 2022
% Result : Theorem 0.23s 1.41s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 7
% Syntax : Number of formulae : 34 ( 10 unt; 0 def)
% Number of atoms : 104 ( 39 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 106 ( 36 ~; 48 |; 13 &)
% ( 6 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-3 aty)
% Number of variables : 81 ( 15 sgn 45 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d3_tarski) ).
fof(t2_xboole_1,axiom,
! [X1] : subset(empty_set,X1),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t2_xboole_1) ).
fof(d3_xboole_0,axiom,
! [X1,X2,X3] :
( X3 = set_intersection2(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( in(X4,X1)
& in(X4,X2) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d3_xboole_0) ).
fof(d1_tarski,axiom,
! [X1,X2] :
( X2 = singleton(X1)
<=> ! [X3] :
( in(X3,X2)
<=> X3 = X1 ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d1_tarski) ).
fof(l28_zfmisc_1,conjecture,
! [X1,X2] :
( ~ in(X1,X2)
=> disjoint(singleton(X1),X2) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',l28_zfmisc_1) ).
fof(d7_xboole_0,axiom,
! [X1,X2] :
( disjoint(X1,X2)
<=> set_intersection2(X1,X2) = empty_set ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d7_xboole_0) ).
fof(commutativity_k3_xboole_0,axiom,
! [X1,X2] : set_intersection2(X1,X2) = set_intersection2(X2,X1),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',commutativity_k3_xboole_0) ).
fof(c_0_7,plain,
! [X4,X5,X6,X4,X5] :
( ( ~ subset(X4,X5)
| ~ in(X6,X4)
| in(X6,X5) )
& ( in(esk4_2(X4,X5),X4)
| subset(X4,X5) )
& ( ~ in(esk4_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_8,plain,
! [X2] : subset(empty_set,X2),
inference(variable_rename,[status(thm)],[t2_xboole_1]) ).
cnf(c_0_9,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,plain,
subset(empty_set,X1),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_11,plain,
! [X5,X6,X7,X8,X8,X5,X6,X7] :
( ( in(X8,X5)
| ~ in(X8,X7)
| X7 != set_intersection2(X5,X6) )
& ( in(X8,X6)
| ~ in(X8,X7)
| X7 != set_intersection2(X5,X6) )
& ( ~ in(X8,X5)
| ~ in(X8,X6)
| in(X8,X7)
| X7 != set_intersection2(X5,X6) )
& ( ~ in(esk5_3(X5,X6,X7),X7)
| ~ in(esk5_3(X5,X6,X7),X5)
| ~ in(esk5_3(X5,X6,X7),X6)
| X7 = set_intersection2(X5,X6) )
& ( in(esk5_3(X5,X6,X7),X5)
| in(esk5_3(X5,X6,X7),X7)
| X7 = set_intersection2(X5,X6) )
& ( in(esk5_3(X5,X6,X7),X6)
| in(esk5_3(X5,X6,X7),X7)
| X7 = set_intersection2(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)],[d3_xboole_0])])])])])])]) ).
cnf(c_0_12,plain,
( in(X1,X2)
| ~ in(X1,empty_set) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,plain,
( X1 = set_intersection2(X2,X3)
| in(esk5_3(X2,X3,X1),X1)
| in(esk5_3(X2,X3,X1),X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_14,plain,
! [X4,X5,X6,X6,X4,X5] :
( ( ~ in(X6,X5)
| X6 = X4
| X5 != singleton(X4) )
& ( X6 != X4
| in(X6,X5)
| X5 != singleton(X4) )
& ( ~ in(esk3_2(X4,X5),X5)
| esk3_2(X4,X5) != X4
| X5 = singleton(X4) )
& ( in(esk3_2(X4,X5),X5)
| esk3_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])])])])])])]) ).
cnf(c_0_15,plain,
( set_intersection2(X1,X2) = empty_set
| in(esk5_3(X1,X2,empty_set),X2)
| in(esk5_3(X1,X2,empty_set),X3) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
fof(c_0_16,negated_conjecture,
~ ! [X1,X2] :
( ~ in(X1,X2)
=> disjoint(singleton(X1),X2) ),
inference(assume_negation,[status(cth)],[l28_zfmisc_1]) ).
cnf(c_0_17,plain,
( X1 = set_intersection2(X2,X3)
| in(esk5_3(X2,X3,X1),X1)
| in(esk5_3(X2,X3,X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,plain,
( X3 = X2
| X1 != singleton(X2)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,plain,
( set_intersection2(X1,X2) = empty_set
| in(esk5_3(X1,X2,empty_set),X2) ),
inference(ef,[status(thm)],[c_0_15]) ).
fof(c_0_20,negated_conjecture,
( ~ in(esk1_0,esk2_0)
& ~ disjoint(singleton(esk1_0),esk2_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_16])])])]) ).
fof(c_0_21,plain,
! [X3,X4,X3,X4] :
( ( ~ disjoint(X3,X4)
| set_intersection2(X3,X4) = empty_set )
& ( set_intersection2(X3,X4) != empty_set
| disjoint(X3,X4) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d7_xboole_0])])])]) ).
fof(c_0_22,plain,
! [X3,X4] : set_intersection2(X3,X4) = set_intersection2(X4,X3),
inference(variable_rename,[status(thm)],[commutativity_k3_xboole_0]) ).
cnf(c_0_23,plain,
( set_intersection2(X1,X2) = empty_set
| in(esk5_3(X1,X2,empty_set),X1)
| in(esk5_3(X1,X2,empty_set),X3) ),
inference(spm,[status(thm)],[c_0_12,c_0_17]) ).
cnf(c_0_24,plain,
( X1 = esk5_3(X2,X3,empty_set)
| set_intersection2(X2,X3) = empty_set
| X3 != singleton(X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,negated_conjecture,
~ disjoint(singleton(esk1_0),esk2_0),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_26,plain,
( disjoint(X1,X2)
| set_intersection2(X1,X2) != empty_set ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_27,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_28,plain,
( set_intersection2(X1,X2) = empty_set
| in(esk5_3(X1,X2,empty_set),X1) ),
inference(ef,[status(thm)],[c_0_23]) ).
cnf(c_0_29,plain,
( esk5_3(X1,singleton(X2),empty_set) = X2
| set_intersection2(X1,singleton(X2)) = empty_set ),
inference(er,[status(thm)],[c_0_24]) ).
cnf(c_0_30,negated_conjecture,
set_intersection2(esk2_0,singleton(esk1_0)) != empty_set,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).
cnf(c_0_31,plain,
( set_intersection2(X1,singleton(X2)) = empty_set
| in(X2,X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,negated_conjecture,
~ in(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU154+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.14/0.34 % Computer : n008.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Sun Jun 19 12:01:07 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.23/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.41 # Preprocessing time : 0.016 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 : 34
% 0.23/1.41 # Proof object clause steps : 19
% 0.23/1.41 # Proof object formula steps : 15
% 0.23/1.41 # Proof object conjectures : 7
% 0.23/1.41 # Proof object clause conjectures : 4
% 0.23/1.41 # Proof object formula conjectures : 3
% 0.23/1.41 # Proof object initial clauses used : 9
% 0.23/1.41 # Proof object initial formulas used : 7
% 0.23/1.41 # Proof object generating inferences : 10
% 0.23/1.41 # Proof object simplifying inferences : 2
% 0.23/1.41 # Training examples: 0 positive, 0 negative
% 0.23/1.41 # Parsed axioms : 18
% 0.23/1.41 # Removed by relevancy pruning/SinE : 3
% 0.23/1.41 # Initial clauses : 29
% 0.23/1.41 # Removed in clause preprocessing : 0
% 0.23/1.41 # Initial clauses in saturation : 29
% 0.23/1.41 # Processed clauses : 1029
% 0.23/1.41 # ...of these trivial : 21
% 0.23/1.41 # ...subsumed : 710
% 0.23/1.41 # ...remaining for further processing : 298
% 0.23/1.41 # Other redundant clauses eliminated : 224
% 0.23/1.41 # Clauses deleted for lack of memory : 0
% 0.23/1.41 # Backward-subsumed : 15
% 0.23/1.41 # Backward-rewritten : 3
% 0.23/1.41 # Generated clauses : 7693
% 0.23/1.41 # ...of the previous two non-trivial : 6621
% 0.23/1.41 # Contextual simplify-reflections : 513
% 0.23/1.41 # Paramodulations : 7387
% 0.23/1.41 # Factorizations : 50
% 0.23/1.41 # Equation resolutions : 256
% 0.23/1.41 # Current number of processed clauses : 277
% 0.23/1.41 # Positive orientable unit clauses : 12
% 0.23/1.41 # Positive unorientable unit clauses: 1
% 0.23/1.41 # Negative unit clauses : 11
% 0.23/1.41 # Non-unit-clauses : 253
% 0.23/1.41 # Current number of unprocessed clauses: 5292
% 0.23/1.41 # ...number of literals in the above : 24105
% 0.23/1.41 # Current number of archived formulas : 0
% 0.23/1.41 # Current number of archived clauses : 18
% 0.23/1.41 # Clause-clause subsumption calls (NU) : 26611
% 0.23/1.41 # Rec. Clause-clause subsumption calls : 18511
% 0.23/1.41 # Non-unit clause-clause subsumptions : 1091
% 0.23/1.41 # Unit Clause-clause subsumption calls : 225
% 0.23/1.41 # Rewrite failures with RHS unbound : 0
% 0.23/1.41 # BW rewrite match attempts : 15
% 0.23/1.41 # BW rewrite match successes : 7
% 0.23/1.41 # Condensation attempts : 0
% 0.23/1.41 # Condensation successes : 0
% 0.23/1.41 # Termbank termtop insertions : 102163
% 0.23/1.41
% 0.23/1.41 # -------------------------------------------------
% 0.23/1.41 # User time : 0.165 s
% 0.23/1.41 # System time : 0.009 s
% 0.23/1.41 # Total time : 0.174 s
% 0.23/1.41 # Maximum resident set size: 7796 pages
% 0.23/23.42 eprover: CPU time limit exceeded, terminating
% 0.23/23.43 eprover: Cannot stat file /export/starexec/sandbox/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/sandbox/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/sandbox/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/sandbox/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/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.46 eprover: No such file or directory
% 0.23/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.46 eprover: No such file or directory
% 0.23/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.47 eprover: No such file or directory
% 0.23/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.47 eprover: No such file or directory
% 0.23/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.48 eprover: No such file or directory
% 0.23/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.49 eprover: No such file or directory
% 0.23/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.49 eprover: No such file or directory
%------------------------------------------------------------------------------