TSTP Solution File: SEU120+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU120+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n013.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:16:54 EDT 2022
% Result : Theorem 0.24s 1.43s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of formulae : 24 ( 5 unt; 0 def)
% Number of atoms : 57 ( 14 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 64 ( 31 ~; 20 |; 11 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 30 ( 7 sgn 18 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t4_xboole_0,conjecture,
! [X1,X2] :
( ~ ( ~ disjoint(X1,X2)
& ! [X3] : ~ in(X3,set_intersection2(X1,X2)) )
& ~ ( ? [X3] : in(X3,set_intersection2(X1,X2))
& disjoint(X1,X2) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t4_xboole_0) ).
fof(d7_xboole_0,axiom,
! [X1,X2] :
( disjoint(X1,X2)
<=> set_intersection2(X1,X2) = empty_set ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d7_xboole_0) ).
fof(d1_xboole_0,axiom,
! [X1] :
( X1 = empty_set
<=> ! [X2] : ~ in(X2,X1) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d1_xboole_0) ).
fof(c_0_3,negated_conjecture,
~ ! [X1,X2] :
( ~ ( ~ disjoint(X1,X2)
& ! [X3] : ~ in(X3,set_intersection2(X1,X2)) )
& ~ ( ? [X3] : in(X3,set_intersection2(X1,X2))
& disjoint(X1,X2) ) ),
inference(assume_negation,[status(cth)],[t4_xboole_0]) ).
fof(c_0_4,negated_conjecture,
! [X6] :
( ( in(esk5_0,set_intersection2(esk3_0,esk4_0))
| ~ disjoint(esk1_0,esk2_0) )
& ( disjoint(esk3_0,esk4_0)
| ~ disjoint(esk1_0,esk2_0) )
& ( in(esk5_0,set_intersection2(esk3_0,esk4_0))
| ~ in(X6,set_intersection2(esk1_0,esk2_0)) )
& ( disjoint(esk3_0,esk4_0)
| ~ in(X6,set_intersection2(esk1_0,esk2_0)) ) ),
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)],[c_0_3])])])])])])])]) ).
fof(c_0_5,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_6,plain,
! [X3,X4,X3] :
( ( X3 != empty_set
| ~ in(X4,X3) )
& ( in(esk6_1(X3),X3)
| X3 = empty_set ) ),
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)],[d1_xboole_0])])])])])])]) ).
cnf(c_0_7,negated_conjecture,
( disjoint(esk3_0,esk4_0)
| ~ disjoint(esk1_0,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
( disjoint(X1,X2)
| set_intersection2(X1,X2) != empty_set ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
( disjoint(esk3_0,esk4_0)
| ~ in(X1,set_intersection2(esk1_0,esk2_0)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_10,plain,
( X1 = empty_set
| in(esk6_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,negated_conjecture,
( disjoint(esk3_0,esk4_0)
| set_intersection2(esk1_0,esk2_0) != empty_set ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,plain,
( set_intersection2(X1,X2) = empty_set
| ~ disjoint(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_13,negated_conjecture,
disjoint(esk3_0,esk4_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).
cnf(c_0_14,negated_conjecture,
( in(esk5_0,set_intersection2(esk3_0,esk4_0))
| ~ disjoint(esk1_0,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_15,negated_conjecture,
set_intersection2(esk3_0,esk4_0) = empty_set,
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,negated_conjecture,
( in(esk5_0,empty_set)
| ~ disjoint(esk1_0,esk2_0) ),
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_17,negated_conjecture,
( in(esk5_0,set_intersection2(esk3_0,esk4_0))
| ~ in(X1,set_intersection2(esk1_0,esk2_0)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_18,plain,
( ~ in(X1,X2)
| X2 != empty_set ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_19,negated_conjecture,
( in(esk5_0,empty_set)
| set_intersection2(esk1_0,esk2_0) != empty_set ),
inference(spm,[status(thm)],[c_0_16,c_0_8]) ).
cnf(c_0_20,negated_conjecture,
( in(esk5_0,empty_set)
| ~ in(X1,set_intersection2(esk1_0,esk2_0)) ),
inference(rw,[status(thm)],[c_0_17,c_0_15]) ).
cnf(c_0_21,negated_conjecture,
set_intersection2(esk1_0,esk2_0) != empty_set,
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,negated_conjecture,
in(esk5_0,empty_set),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_10]),c_0_21]) ).
cnf(c_0_23,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_18,c_0_22]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SEU120+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.14/0.35 % Computer : n013.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 : 600
% 0.14/0.35 % DateTime : Sun Jun 19 23:34:59 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.24/1.43 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.43 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.43 # Preprocessing time : 0.015 s
% 0.24/1.43
% 0.24/1.43 # Proof found!
% 0.24/1.43 # SZS status Theorem
% 0.24/1.43 # SZS output start CNFRefutation
% See solution above
% 0.24/1.43 # Proof object total steps : 24
% 0.24/1.43 # Proof object clause steps : 17
% 0.24/1.43 # Proof object formula steps : 7
% 0.24/1.43 # Proof object conjectures : 16
% 0.24/1.43 # Proof object clause conjectures : 13
% 0.24/1.43 # Proof object formula conjectures : 3
% 0.24/1.43 # Proof object initial clauses used : 8
% 0.24/1.43 # Proof object initial formulas used : 3
% 0.24/1.43 # Proof object generating inferences : 7
% 0.24/1.43 # Proof object simplifying inferences : 4
% 0.24/1.43 # Training examples: 0 positive, 0 negative
% 0.24/1.43 # Parsed axioms : 12
% 0.24/1.43 # Removed by relevancy pruning/SinE : 2
% 0.24/1.43 # Initial clauses : 15
% 0.24/1.43 # Removed in clause preprocessing : 0
% 0.24/1.43 # Initial clauses in saturation : 15
% 0.24/1.43 # Processed clauses : 27
% 0.24/1.43 # ...of these trivial : 1
% 0.24/1.43 # ...subsumed : 1
% 0.24/1.43 # ...remaining for further processing : 25
% 0.24/1.43 # Other redundant clauses eliminated : 0
% 0.24/1.43 # Clauses deleted for lack of memory : 0
% 0.24/1.43 # Backward-subsumed : 2
% 0.24/1.43 # Backward-rewritten : 6
% 0.24/1.43 # Generated clauses : 25
% 0.24/1.43 # ...of the previous two non-trivial : 21
% 0.24/1.43 # Contextual simplify-reflections : 1
% 0.24/1.43 # Paramodulations : 25
% 0.24/1.43 # Factorizations : 0
% 0.24/1.43 # Equation resolutions : 0
% 0.24/1.43 # Current number of processed clauses : 17
% 0.24/1.43 # Positive orientable unit clauses : 7
% 0.24/1.43 # Positive unorientable unit clauses: 1
% 0.24/1.43 # Negative unit clauses : 2
% 0.24/1.43 # Non-unit-clauses : 7
% 0.24/1.43 # Current number of unprocessed clauses: 4
% 0.24/1.43 # ...number of literals in the above : 7
% 0.24/1.43 # Current number of archived formulas : 0
% 0.24/1.43 # Current number of archived clauses : 8
% 0.24/1.43 # Clause-clause subsumption calls (NU) : 12
% 0.24/1.43 # Rec. Clause-clause subsumption calls : 12
% 0.24/1.43 # Non-unit clause-clause subsumptions : 1
% 0.24/1.43 # Unit Clause-clause subsumption calls : 5
% 0.24/1.43 # Rewrite failures with RHS unbound : 0
% 0.24/1.43 # BW rewrite match attempts : 11
% 0.24/1.43 # BW rewrite match successes : 11
% 0.24/1.43 # Condensation attempts : 0
% 0.24/1.43 # Condensation successes : 0
% 0.24/1.43 # Termbank termtop insertions : 839
% 0.24/1.43
% 0.24/1.43 # -------------------------------------------------
% 0.24/1.43 # User time : 0.012 s
% 0.24/1.43 # System time : 0.004 s
% 0.24/1.43 # Total time : 0.016 s
% 0.24/1.43 # Maximum resident set size: 2772 pages
%------------------------------------------------------------------------------