TSTP Solution File: SEU104+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU104+1 : TPTP v8.1.0. Released v3.2.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:49 EDT 2022
% Result : Theorem 0.27s 1.46s
% Output : CNFRefutation 0.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 26 ( 6 unt; 0 def)
% Number of atoms : 85 ( 3 equ)
% Maximal formula atoms : 15 ( 3 avg)
% Number of connectives : 101 ( 42 ~; 37 |; 11 &)
% ( 1 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-2 aty)
% Number of variables : 43 ( 1 sgn 23 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t15_finsub_1,conjecture,
! [X1] :
( ~ empty(X1)
=> ( ! [X2] :
( element(X2,X1)
=> ! [X3] :
( element(X3,X1)
=> ( in(symmetric_difference(X2,X3),X1)
& in(set_difference(X2,X3),X1) ) ) )
=> preboolean(X1) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t15_finsub_1) ).
fof(t1_subset,axiom,
! [X1,X2] :
( in(X1,X2)
=> element(X1,X2) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t1_subset) ).
fof(t10_finsub_1,axiom,
! [X1] :
( preboolean(X1)
<=> ! [X2,X3] :
( ( in(X2,X1)
& in(X3,X1) )
=> ( in(set_union2(X2,X3),X1)
& in(set_difference(X2,X3),X1) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t10_finsub_1) ).
fof(t98_xboole_1,axiom,
! [X1,X2] : set_union2(X1,X2) = symmetric_difference(X1,set_difference(X2,X1)),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t98_xboole_1) ).
fof(c_0_4,negated_conjecture,
~ ! [X1] :
( ~ empty(X1)
=> ( ! [X2] :
( element(X2,X1)
=> ! [X3] :
( element(X3,X1)
=> ( in(symmetric_difference(X2,X3),X1)
& in(set_difference(X2,X3),X1) ) ) )
=> preboolean(X1) ) ),
inference(assume_negation,[status(cth)],[t15_finsub_1]) ).
fof(c_0_5,negated_conjecture,
! [X5,X6] :
( ~ empty(esk1_0)
& ( in(symmetric_difference(X5,X6),esk1_0)
| ~ element(X6,esk1_0)
| ~ element(X5,esk1_0) )
& ( in(set_difference(X5,X6),esk1_0)
| ~ element(X6,esk1_0)
| ~ element(X5,esk1_0) )
& ~ preboolean(esk1_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_4])])])])])])])]) ).
fof(c_0_6,plain,
! [X3,X4] :
( ~ in(X3,X4)
| element(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_subset])]) ).
fof(c_0_7,plain,
! [X4,X5,X6,X4] :
( ( in(set_union2(X5,X6),X4)
| ~ in(X5,X4)
| ~ in(X6,X4)
| ~ preboolean(X4) )
& ( in(set_difference(X5,X6),X4)
| ~ in(X5,X4)
| ~ in(X6,X4)
| ~ preboolean(X4) )
& ( in(esk2_1(X4),X4)
| preboolean(X4) )
& ( in(esk3_1(X4),X4)
| preboolean(X4) )
& ( ~ in(set_union2(esk2_1(X4),esk3_1(X4)),X4)
| ~ in(set_difference(esk2_1(X4),esk3_1(X4)),X4)
| preboolean(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)],[t10_finsub_1])])])])])])]) ).
fof(c_0_8,plain,
! [X3,X4] : set_union2(X3,X4) = symmetric_difference(X3,set_difference(X4,X3)),
inference(variable_rename,[status(thm)],[t98_xboole_1]) ).
cnf(c_0_9,negated_conjecture,
( in(symmetric_difference(X1,X2),esk1_0)
| ~ element(X1,esk1_0)
| ~ element(X2,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,plain,
( element(X1,X2)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( preboolean(X1)
| ~ in(set_difference(esk2_1(X1),esk3_1(X1)),X1)
| ~ in(set_union2(esk2_1(X1),esk3_1(X1)),X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
set_union2(X1,X2) = symmetric_difference(X1,set_difference(X2,X1)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
( in(symmetric_difference(X1,X2),esk1_0)
| ~ element(X1,esk1_0)
| ~ in(X2,esk1_0) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,negated_conjecture,
( in(set_difference(X1,X2),esk1_0)
| ~ element(X1,esk1_0)
| ~ element(X2,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_15,plain,
( preboolean(X1)
| ~ in(set_difference(esk2_1(X1),esk3_1(X1)),X1)
| ~ in(symmetric_difference(esk2_1(X1),set_difference(esk3_1(X1),esk2_1(X1))),X1) ),
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,negated_conjecture,
( in(symmetric_difference(X1,X2),esk1_0)
| ~ in(X2,esk1_0)
| ~ in(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_13,c_0_10]) ).
cnf(c_0_17,negated_conjecture,
~ preboolean(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_18,negated_conjecture,
( in(set_difference(X1,X2),esk1_0)
| ~ element(X1,esk1_0)
| ~ in(X2,esk1_0) ),
inference(spm,[status(thm)],[c_0_14,c_0_10]) ).
cnf(c_0_19,negated_conjecture,
( ~ in(set_difference(esk2_1(esk1_0),esk3_1(esk1_0)),esk1_0)
| ~ in(set_difference(esk3_1(esk1_0),esk2_1(esk1_0)),esk1_0)
| ~ in(esk2_1(esk1_0),esk1_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
cnf(c_0_20,negated_conjecture,
( in(set_difference(X1,X2),esk1_0)
| ~ in(X2,esk1_0)
| ~ in(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_18,c_0_10]) ).
cnf(c_0_21,negated_conjecture,
( ~ in(esk2_1(esk1_0),esk1_0)
| ~ in(esk3_1(esk1_0),esk1_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_20]) ).
cnf(c_0_22,plain,
( preboolean(X1)
| in(esk3_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_23,negated_conjecture,
~ in(esk2_1(esk1_0),esk1_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_17]) ).
cnf(c_0_24,plain,
( preboolean(X1)
| in(esk2_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_25,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_17]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : SEU104+1 : TPTP v8.1.0. Released v3.2.0.
% 0.08/0.15 % Command : run_ET %s %d
% 0.14/0.37 % Computer : n013.cluster.edu
% 0.14/0.37 % Model : x86_64 x86_64
% 0.14/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37 % Memory : 8042.1875MB
% 0.14/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37 % CPULimit : 300
% 0.14/0.37 % WCLimit : 600
% 0.14/0.37 % DateTime : Sun Jun 19 08:33:59 EDT 2022
% 0.14/0.37 % CPUTime :
% 0.27/1.46 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.27/1.46 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.27/1.46 # Preprocessing time : 0.019 s
% 0.27/1.46
% 0.27/1.46 # Proof found!
% 0.27/1.46 # SZS status Theorem
% 0.27/1.46 # SZS output start CNFRefutation
% See solution above
% 0.27/1.46 # Proof object total steps : 26
% 0.27/1.46 # Proof object clause steps : 17
% 0.27/1.46 # Proof object formula steps : 9
% 0.27/1.46 # Proof object conjectures : 14
% 0.27/1.46 # Proof object clause conjectures : 11
% 0.27/1.46 # Proof object formula conjectures : 3
% 0.27/1.46 # Proof object initial clauses used : 8
% 0.27/1.46 # Proof object initial formulas used : 4
% 0.27/1.46 # Proof object generating inferences : 8
% 0.27/1.46 # Proof object simplifying inferences : 5
% 0.27/1.46 # Training examples: 0 positive, 0 negative
% 0.27/1.46 # Parsed axioms : 42
% 0.27/1.46 # Removed by relevancy pruning/SinE : 6
% 0.27/1.46 # Initial clauses : 50
% 0.27/1.46 # Removed in clause preprocessing : 1
% 0.27/1.46 # Initial clauses in saturation : 49
% 0.27/1.46 # Processed clauses : 71
% 0.27/1.46 # ...of these trivial : 3
% 0.27/1.46 # ...subsumed : 2
% 0.27/1.46 # ...remaining for further processing : 66
% 0.27/1.46 # Other redundant clauses eliminated : 0
% 0.27/1.46 # Clauses deleted for lack of memory : 0
% 0.27/1.46 # Backward-subsumed : 0
% 0.27/1.46 # Backward-rewritten : 9
% 0.27/1.46 # Generated clauses : 148
% 0.27/1.46 # ...of the previous two non-trivial : 102
% 0.27/1.46 # Contextual simplify-reflections : 1
% 0.27/1.46 # Paramodulations : 148
% 0.27/1.46 # Factorizations : 0
% 0.27/1.46 # Equation resolutions : 0
% 0.27/1.46 # Current number of processed clauses : 57
% 0.27/1.46 # Positive orientable unit clauses : 12
% 0.27/1.46 # Positive unorientable unit clauses: 2
% 0.27/1.46 # Negative unit clauses : 6
% 0.27/1.46 # Non-unit-clauses : 37
% 0.27/1.46 # Current number of unprocessed clauses: 63
% 0.27/1.46 # ...number of literals in the above : 146
% 0.27/1.46 # Current number of archived formulas : 0
% 0.27/1.46 # Current number of archived clauses : 10
% 0.27/1.46 # Clause-clause subsumption calls (NU) : 166
% 0.27/1.46 # Rec. Clause-clause subsumption calls : 141
% 0.27/1.46 # Non-unit clause-clause subsumptions : 3
% 0.27/1.46 # Unit Clause-clause subsumption calls : 18
% 0.27/1.46 # Rewrite failures with RHS unbound : 0
% 0.27/1.46 # BW rewrite match attempts : 22
% 0.27/1.46 # BW rewrite match successes : 15
% 0.27/1.46 # Condensation attempts : 0
% 0.27/1.46 # Condensation successes : 0
% 0.27/1.46 # Termbank termtop insertions : 3947
% 0.27/1.46
% 0.27/1.46 # -------------------------------------------------
% 0.27/1.46 # User time : 0.019 s
% 0.27/1.46 # System time : 0.004 s
% 0.27/1.46 # Total time : 0.023 s
% 0.27/1.46 # Maximum resident set size: 3060 pages
%------------------------------------------------------------------------------