TSTP Solution File: SEU406+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU406+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n019.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:19:43 EDT 2022
% Result : Theorem 0.23s 1.42s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 24 ( 12 unt; 0 def)
% Number of atoms : 84 ( 14 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 104 ( 44 ~; 30 |; 28 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-3 aty)
% Number of variables : 42 ( 4 sgn 28 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d2_xboole_0,axiom,
! [X1,X2,X3] :
( X3 = k2_xboole_0(X1,X2)
<=> ! [X4] :
( r2_hidden(X4,X3)
<=> ( r2_hidden(X4,X1)
| r2_hidden(X4,X2) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d2_xboole_0) ).
fof(t1_latsum_1,conjecture,
! [X1,X2,X3,X4] :
~ ( r2_hidden(X1,k2_xboole_0(X3,X4))
& r2_hidden(X2,k2_xboole_0(X3,X4))
& ~ ( r2_hidden(X1,k4_xboole_0(X3,X4))
& r2_hidden(X2,k4_xboole_0(X3,X4)) )
& ~ ( r2_hidden(X1,X4)
& r2_hidden(X2,X4) )
& ~ ( r2_hidden(X1,k4_xboole_0(X3,X4))
& r2_hidden(X2,X4) )
& ~ ( r2_hidden(X1,X4)
& r2_hidden(X2,k4_xboole_0(X3,X4)) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t1_latsum_1) ).
fof(t39_xboole_1,axiom,
! [X1,X2] : k2_xboole_0(X1,k4_xboole_0(X2,X1)) = k2_xboole_0(X1,X2),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t39_xboole_1) ).
fof(commutativity_k2_xboole_0,axiom,
! [X1,X2] : k2_xboole_0(X1,X2) = k2_xboole_0(X2,X1),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',commutativity_k2_xboole_0) ).
fof(c_0_4,plain,
! [X5,X6,X7,X8,X8,X5,X6,X7] :
( ( ~ r2_hidden(X8,X7)
| r2_hidden(X8,X5)
| r2_hidden(X8,X6)
| X7 != k2_xboole_0(X5,X6) )
& ( ~ r2_hidden(X8,X5)
| r2_hidden(X8,X7)
| X7 != k2_xboole_0(X5,X6) )
& ( ~ r2_hidden(X8,X6)
| r2_hidden(X8,X7)
| X7 != k2_xboole_0(X5,X6) )
& ( ~ r2_hidden(esk5_3(X5,X6,X7),X5)
| ~ r2_hidden(esk5_3(X5,X6,X7),X7)
| X7 = k2_xboole_0(X5,X6) )
& ( ~ r2_hidden(esk5_3(X5,X6,X7),X6)
| ~ r2_hidden(esk5_3(X5,X6,X7),X7)
| X7 = k2_xboole_0(X5,X6) )
& ( r2_hidden(esk5_3(X5,X6,X7),X7)
| r2_hidden(esk5_3(X5,X6,X7),X5)
| r2_hidden(esk5_3(X5,X6,X7),X6)
| X7 = k2_xboole_0(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)],[d2_xboole_0])])])])])])]) ).
fof(c_0_5,negated_conjecture,
~ ! [X1,X2,X3,X4] :
~ ( r2_hidden(X1,k2_xboole_0(X3,X4))
& r2_hidden(X2,k2_xboole_0(X3,X4))
& ~ ( r2_hidden(X1,k4_xboole_0(X3,X4))
& r2_hidden(X2,k4_xboole_0(X3,X4)) )
& ~ ( r2_hidden(X1,X4)
& r2_hidden(X2,X4) )
& ~ ( r2_hidden(X1,k4_xboole_0(X3,X4))
& r2_hidden(X2,X4) )
& ~ ( r2_hidden(X1,X4)
& r2_hidden(X2,k4_xboole_0(X3,X4)) ) ),
inference(assume_negation,[status(cth)],[t1_latsum_1]) ).
cnf(c_0_6,plain,
( r2_hidden(X4,X3)
| r2_hidden(X4,X2)
| X1 != k2_xboole_0(X2,X3)
| ~ r2_hidden(X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_7,plain,
! [X3,X4] : k2_xboole_0(X3,k4_xboole_0(X4,X3)) = k2_xboole_0(X3,X4),
inference(variable_rename,[status(thm)],[t39_xboole_1]) ).
fof(c_0_8,negated_conjecture,
( r2_hidden(esk1_0,k2_xboole_0(esk3_0,esk4_0))
& r2_hidden(esk2_0,k2_xboole_0(esk3_0,esk4_0))
& ( ~ r2_hidden(esk1_0,k4_xboole_0(esk3_0,esk4_0))
| ~ r2_hidden(esk2_0,k4_xboole_0(esk3_0,esk4_0)) )
& ( ~ r2_hidden(esk1_0,esk4_0)
| ~ r2_hidden(esk2_0,esk4_0) )
& ( ~ r2_hidden(esk1_0,k4_xboole_0(esk3_0,esk4_0))
| ~ r2_hidden(esk2_0,esk4_0) )
& ( ~ r2_hidden(esk1_0,esk4_0)
| ~ r2_hidden(esk2_0,k4_xboole_0(esk3_0,esk4_0)) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
cnf(c_0_9,plain,
( r2_hidden(X1,X2)
| r2_hidden(X1,X3)
| ~ r2_hidden(X1,k2_xboole_0(X3,X2)) ),
inference(er,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
k2_xboole_0(X1,k4_xboole_0(X2,X1)) = k2_xboole_0(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_11,plain,
! [X3,X4] : k2_xboole_0(X3,X4) = k2_xboole_0(X4,X3),
inference(variable_rename,[status(thm)],[commutativity_k2_xboole_0]) ).
cnf(c_0_12,negated_conjecture,
( ~ r2_hidden(esk2_0,k4_xboole_0(esk3_0,esk4_0))
| ~ r2_hidden(esk1_0,esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( r2_hidden(X1,k4_xboole_0(X2,X3))
| r2_hidden(X1,X3)
| ~ r2_hidden(X1,k2_xboole_0(X3,X2)) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
k2_xboole_0(X1,X2) = k2_xboole_0(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,negated_conjecture,
r2_hidden(esk2_0,k2_xboole_0(esk3_0,esk4_0)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_16,negated_conjecture,
( ~ r2_hidden(esk2_0,esk4_0)
| ~ r2_hidden(esk1_0,esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_17,negated_conjecture,
( ~ r2_hidden(esk2_0,esk4_0)
| ~ r2_hidden(esk1_0,k4_xboole_0(esk3_0,esk4_0)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_18,negated_conjecture,
r2_hidden(esk1_0,k2_xboole_0(esk3_0,esk4_0)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_19,negated_conjecture,
~ r2_hidden(esk1_0,esk4_0),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]),c_0_15])]),c_0_16]) ).
cnf(c_0_20,negated_conjecture,
( ~ r2_hidden(esk2_0,k4_xboole_0(esk3_0,esk4_0))
| ~ r2_hidden(esk1_0,k4_xboole_0(esk3_0,esk4_0)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_21,negated_conjecture,
~ r2_hidden(esk2_0,esk4_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_13]),c_0_14]),c_0_18])]),c_0_19]) ).
cnf(c_0_22,negated_conjecture,
~ r2_hidden(esk1_0,k4_xboole_0(esk3_0,esk4_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_13]),c_0_14]),c_0_15])]),c_0_21]) ).
cnf(c_0_23,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_13]),c_0_14]),c_0_18])]),c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU406+1 : TPTP v8.1.0. Released v3.4.0.
% 0.11/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n019.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun Jun 19 16:47:24 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.23/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.42 # Preprocessing time : 0.015 s
% 0.23/1.42
% 0.23/1.42 # Proof found!
% 0.23/1.42 # SZS status Theorem
% 0.23/1.42 # SZS output start CNFRefutation
% See solution above
% 0.23/1.42 # Proof object total steps : 24
% 0.23/1.42 # Proof object clause steps : 15
% 0.23/1.42 # Proof object formula steps : 9
% 0.23/1.42 # Proof object conjectures : 13
% 0.23/1.42 # Proof object clause conjectures : 10
% 0.23/1.42 # Proof object formula conjectures : 3
% 0.23/1.42 # Proof object initial clauses used : 9
% 0.23/1.42 # Proof object initial formulas used : 4
% 0.23/1.42 # Proof object generating inferences : 6
% 0.23/1.42 # Proof object simplifying inferences : 16
% 0.23/1.42 # Training examples: 0 positive, 0 negative
% 0.23/1.42 # Parsed axioms : 24
% 0.23/1.42 # Removed by relevancy pruning/SinE : 7
% 0.23/1.42 # Initial clauses : 27
% 0.23/1.42 # Removed in clause preprocessing : 0
% 0.23/1.42 # Initial clauses in saturation : 27
% 0.23/1.42 # Processed clauses : 333
% 0.23/1.42 # ...of these trivial : 1
% 0.23/1.42 # ...subsumed : 187
% 0.23/1.42 # ...remaining for further processing : 145
% 0.23/1.42 # Other redundant clauses eliminated : 27
% 0.23/1.42 # Clauses deleted for lack of memory : 0
% 0.23/1.42 # Backward-subsumed : 7
% 0.23/1.42 # Backward-rewritten : 9
% 0.23/1.42 # Generated clauses : 1050
% 0.23/1.42 # ...of the previous two non-trivial : 916
% 0.23/1.42 # Contextual simplify-reflections : 49
% 0.23/1.42 # Paramodulations : 983
% 0.23/1.42 # Factorizations : 32
% 0.23/1.42 # Equation resolutions : 33
% 0.23/1.42 # Current number of processed clauses : 127
% 0.23/1.42 # Positive orientable unit clauses : 12
% 0.23/1.42 # Positive unorientable unit clauses: 1
% 0.23/1.42 # Negative unit clauses : 9
% 0.23/1.42 # Non-unit-clauses : 105
% 0.23/1.42 # Current number of unprocessed clauses: 560
% 0.23/1.42 # ...number of literals in the above : 2044
% 0.23/1.42 # Current number of archived formulas : 0
% 0.23/1.42 # Current number of archived clauses : 18
% 0.23/1.42 # Clause-clause subsumption calls (NU) : 3802
% 0.23/1.42 # Rec. Clause-clause subsumption calls : 2814
% 0.23/1.42 # Non-unit clause-clause subsumptions : 235
% 0.23/1.42 # Unit Clause-clause subsumption calls : 122
% 0.23/1.42 # Rewrite failures with RHS unbound : 0
% 0.23/1.42 # BW rewrite match attempts : 15
% 0.23/1.42 # BW rewrite match successes : 13
% 0.23/1.42 # Condensation attempts : 0
% 0.23/1.42 # Condensation successes : 0
% 0.23/1.42 # Termbank termtop insertions : 12639
% 0.23/1.42
% 0.23/1.42 # -------------------------------------------------
% 0.23/1.42 # User time : 0.046 s
% 0.23/1.42 # System time : 0.004 s
% 0.23/1.42 # Total time : 0.050 s
% 0.23/1.42 # Maximum resident set size: 3580 pages
%------------------------------------------------------------------------------