TSTP Solution File: SEU420+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU420+2 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n020.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:57 EDT 2022
% Result : Theorem 0.45s 1.64s
% Output : CNFRefutation 0.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of formulae : 40 ( 24 unt; 0 def)
% Number of atoms : 73 ( 11 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 61 ( 28 ~; 20 |; 3 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 70 ( 3 sgn 38 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t13_relset_2,conjecture,
! [X1,X2] :
( v1_relat_1(X2)
=> ! [X3] :
( v1_relat_1(X3)
=> r1_tarski(k9_relat_1(k3_xboole_0(X2,X3),k3_pua2mss1(X1)),k3_xboole_0(k9_relat_1(X2,k3_pua2mss1(X1)),k9_relat_1(X3,k3_pua2mss1(X1)))) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t13_relset_2) ).
fof(t48_xboole_1,axiom,
! [X1,X2] : k4_xboole_0(X1,k4_xboole_0(X1,X2)) = k3_xboole_0(X1,X2),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+4.ax',t48_xboole_1) ).
fof(commutativity_k3_xboole_0,axiom,
! [X1,X2] : k3_xboole_0(X1,X2) = k3_xboole_0(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+2.ax',commutativity_k3_xboole_0) ).
fof(t19_xboole_1,axiom,
! [X1,X2,X3] :
( ( r1_tarski(X1,X2)
& r1_tarski(X1,X3) )
=> r1_tarski(X1,k3_xboole_0(X2,X3)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+4.ax',t19_xboole_1) ).
fof(t157_relat_1,axiom,
! [X1,X2] :
( v1_relat_1(X2)
=> ! [X3] :
( v1_relat_1(X3)
=> ( r1_tarski(X2,X3)
=> r1_tarski(k9_relat_1(X2,X1),k9_relat_1(X3,X1)) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+10.ax',t157_relat_1) ).
fof(t3_relat_1,axiom,
! [X1,X2] :
( v1_relat_1(X2)
=> ( r1_tarski(X1,X2)
=> v1_relat_1(X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+10.ax',t3_relat_1) ).
fof(t17_xboole_1,axiom,
! [X1,X2] : r1_tarski(k3_xboole_0(X1,X2),X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+4.ax',t17_xboole_1) ).
fof(t47_xboole_1,axiom,
! [X1,X2] : k4_xboole_0(X1,k3_xboole_0(X1,X2)) = k4_xboole_0(X1,X2),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+4.ax',t47_xboole_1) ).
fof(c_0_8,negated_conjecture,
~ ! [X1,X2] :
( v1_relat_1(X2)
=> ! [X3] :
( v1_relat_1(X3)
=> r1_tarski(k9_relat_1(k3_xboole_0(X2,X3),k3_pua2mss1(X1)),k3_xboole_0(k9_relat_1(X2,k3_pua2mss1(X1)),k9_relat_1(X3,k3_pua2mss1(X1)))) ) ),
inference(assume_negation,[status(cth)],[t13_relset_2]) ).
fof(c_0_9,negated_conjecture,
( v1_relat_1(esk2_0)
& v1_relat_1(esk3_0)
& ~ r1_tarski(k9_relat_1(k3_xboole_0(esk2_0,esk3_0),k3_pua2mss1(esk1_0)),k3_xboole_0(k9_relat_1(esk2_0,k3_pua2mss1(esk1_0)),k9_relat_1(esk3_0,k3_pua2mss1(esk1_0)))) ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])])]) ).
fof(c_0_10,plain,
! [X3,X4] : k4_xboole_0(X3,k4_xboole_0(X3,X4)) = k3_xboole_0(X3,X4),
inference(variable_rename,[status(thm)],[t48_xboole_1]) ).
fof(c_0_11,plain,
! [X3,X4] : k3_xboole_0(X3,X4) = k3_xboole_0(X4,X3),
inference(variable_rename,[status(thm)],[commutativity_k3_xboole_0]) ).
cnf(c_0_12,negated_conjecture,
~ r1_tarski(k9_relat_1(k3_xboole_0(esk2_0,esk3_0),k3_pua2mss1(esk1_0)),k3_xboole_0(k9_relat_1(esk2_0,k3_pua2mss1(esk1_0)),k9_relat_1(esk3_0,k3_pua2mss1(esk1_0)))),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
k4_xboole_0(X1,k4_xboole_0(X1,X2)) = k3_xboole_0(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
k3_xboole_0(X1,X2) = k3_xboole_0(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_15,plain,
! [X4,X5,X6] :
( ~ r1_tarski(X4,X5)
| ~ r1_tarski(X4,X6)
| r1_tarski(X4,k3_xboole_0(X5,X6)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t19_xboole_1])]) ).
cnf(c_0_16,negated_conjecture,
~ r1_tarski(k9_relat_1(k4_xboole_0(esk2_0,k4_xboole_0(esk2_0,esk3_0)),k3_pua2mss1(esk1_0)),k4_xboole_0(k9_relat_1(esk2_0,k3_pua2mss1(esk1_0)),k4_xboole_0(k9_relat_1(esk2_0,k3_pua2mss1(esk1_0)),k9_relat_1(esk3_0,k3_pua2mss1(esk1_0))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13]),c_0_13]) ).
cnf(c_0_17,plain,
k4_xboole_0(X1,k4_xboole_0(X1,X2)) = k4_xboole_0(X2,k4_xboole_0(X2,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_13]),c_0_13]) ).
cnf(c_0_18,plain,
( r1_tarski(X1,k3_xboole_0(X2,X3))
| ~ r1_tarski(X1,X3)
| ~ r1_tarski(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_19,plain,
! [X4,X5,X6] :
( ~ v1_relat_1(X5)
| ~ v1_relat_1(X6)
| ~ r1_tarski(X5,X6)
| r1_tarski(k9_relat_1(X5,X4),k9_relat_1(X6,X4)) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t157_relat_1])])])])]) ).
fof(c_0_20,plain,
! [X3,X4] :
( ~ v1_relat_1(X4)
| ~ r1_tarski(X3,X4)
| v1_relat_1(X3) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_relat_1])]) ).
fof(c_0_21,plain,
! [X3,X4] : r1_tarski(k3_xboole_0(X3,X4),X3),
inference(variable_rename,[status(thm)],[t17_xboole_1]) ).
fof(c_0_22,plain,
! [X3,X4] : k4_xboole_0(X3,k3_xboole_0(X3,X4)) = k4_xboole_0(X3,X4),
inference(variable_rename,[status(thm)],[t47_xboole_1]) ).
cnf(c_0_23,negated_conjecture,
~ r1_tarski(k9_relat_1(k4_xboole_0(esk3_0,k4_xboole_0(esk3_0,esk2_0)),k3_pua2mss1(esk1_0)),k4_xboole_0(k9_relat_1(esk3_0,k3_pua2mss1(esk1_0)),k4_xboole_0(k9_relat_1(esk3_0,k3_pua2mss1(esk1_0)),k9_relat_1(esk2_0,k3_pua2mss1(esk1_0))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17]),c_0_17]) ).
cnf(c_0_24,plain,
( r1_tarski(X1,k4_xboole_0(X2,k4_xboole_0(X2,X3)))
| ~ r1_tarski(X1,X3)
| ~ r1_tarski(X1,X2) ),
inference(rw,[status(thm)],[c_0_18,c_0_13]) ).
cnf(c_0_25,plain,
( r1_tarski(k9_relat_1(X1,X2),k9_relat_1(X3,X2))
| ~ r1_tarski(X1,X3)
| ~ v1_relat_1(X3)
| ~ v1_relat_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_26,plain,
( v1_relat_1(X1)
| ~ r1_tarski(X1,X2)
| ~ v1_relat_1(X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_27,plain,
r1_tarski(k3_xboole_0(X1,X2),X1),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_28,plain,
k4_xboole_0(X1,k3_xboole_0(X1,X2)) = k4_xboole_0(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_29,negated_conjecture,
( ~ r1_tarski(k9_relat_1(k4_xboole_0(esk3_0,k4_xboole_0(esk3_0,esk2_0)),k3_pua2mss1(esk1_0)),k9_relat_1(esk2_0,k3_pua2mss1(esk1_0)))
| ~ r1_tarski(k9_relat_1(k4_xboole_0(esk3_0,k4_xboole_0(esk3_0,esk2_0)),k3_pua2mss1(esk1_0)),k9_relat_1(esk3_0,k3_pua2mss1(esk1_0))) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_30,plain,
( r1_tarski(k9_relat_1(X1,X2),k9_relat_1(X3,X2))
| ~ v1_relat_1(X3)
| ~ r1_tarski(X1,X3) ),
inference(csr,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_31,negated_conjecture,
v1_relat_1(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_32,plain,
r1_tarski(k4_xboole_0(X1,k4_xboole_0(X1,X2)),X1),
inference(rw,[status(thm)],[c_0_27,c_0_13]) ).
cnf(c_0_33,plain,
k4_xboole_0(X1,k4_xboole_0(X1,k4_xboole_0(X1,X2))) = k4_xboole_0(X1,X2),
inference(rw,[status(thm)],[c_0_28,c_0_13]) ).
cnf(c_0_34,negated_conjecture,
( ~ r1_tarski(k9_relat_1(k4_xboole_0(esk3_0,k4_xboole_0(esk3_0,esk2_0)),k3_pua2mss1(esk1_0)),k9_relat_1(esk3_0,k3_pua2mss1(esk1_0)))
| ~ r1_tarski(k4_xboole_0(esk3_0,k4_xboole_0(esk3_0,esk2_0)),esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]) ).
cnf(c_0_35,negated_conjecture,
v1_relat_1(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_36,plain,
r1_tarski(k4_xboole_0(X1,X2),X1),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_37,negated_conjecture,
~ r1_tarski(k4_xboole_0(esk3_0,k4_xboole_0(esk3_0,esk2_0)),esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_30]),c_0_35]),c_0_32])]) ).
cnf(c_0_38,plain,
r1_tarski(k4_xboole_0(X1,k4_xboole_0(X1,X2)),X2),
inference(spm,[status(thm)],[c_0_36,c_0_17]) ).
cnf(c_0_39,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_38])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SEU420+2 : TPTP v8.1.0. Released v3.4.0.
% 0.04/0.13 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n020.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jun 20 13:30:48 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.45/1.64 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.45/1.64 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.45/1.64 # Preprocessing time : 0.104 s
% 0.45/1.64
% 0.45/1.64 # Proof found!
% 0.45/1.64 # SZS status Theorem
% 0.45/1.64 # SZS output start CNFRefutation
% See solution above
% 0.45/1.64 # Proof object total steps : 40
% 0.45/1.64 # Proof object clause steps : 23
% 0.45/1.64 # Proof object formula steps : 17
% 0.45/1.64 # Proof object conjectures : 12
% 0.45/1.64 # Proof object clause conjectures : 9
% 0.45/1.64 # Proof object formula conjectures : 3
% 0.45/1.64 # Proof object initial clauses used : 10
% 0.45/1.64 # Proof object initial formulas used : 8
% 0.45/1.64 # Proof object generating inferences : 5
% 0.45/1.64 # Proof object simplifying inferences : 17
% 0.45/1.64 # Training examples: 0 positive, 0 negative
% 0.45/1.64 # Parsed axioms : 4482
% 0.45/1.64 # Removed by relevancy pruning/SinE : 4381
% 0.45/1.64 # Initial clauses : 143
% 0.45/1.64 # Removed in clause preprocessing : 5
% 0.45/1.64 # Initial clauses in saturation : 138
% 0.45/1.64 # Processed clauses : 372
% 0.45/1.64 # ...of these trivial : 37
% 0.45/1.64 # ...subsumed : 94
% 0.45/1.64 # ...remaining for further processing : 241
% 0.45/1.64 # Other redundant clauses eliminated : 27
% 0.45/1.64 # Clauses deleted for lack of memory : 0
% 0.45/1.64 # Backward-subsumed : 7
% 0.45/1.64 # Backward-rewritten : 23
% 0.45/1.64 # Generated clauses : 6200
% 0.45/1.64 # ...of the previous two non-trivial : 4854
% 0.45/1.64 # Contextual simplify-reflections : 17
% 0.45/1.64 # Paramodulations : 6164
% 0.45/1.64 # Factorizations : 4
% 0.45/1.64 # Equation resolutions : 32
% 0.45/1.64 # Current number of processed clauses : 209
% 0.45/1.64 # Positive orientable unit clauses : 45
% 0.45/1.64 # Positive unorientable unit clauses: 5
% 0.45/1.64 # Negative unit clauses : 3
% 0.45/1.64 # Non-unit-clauses : 156
% 0.45/1.64 # Current number of unprocessed clauses: 3899
% 0.45/1.64 # ...number of literals in the above : 9288
% 0.45/1.64 # Current number of archived formulas : 0
% 0.45/1.64 # Current number of archived clauses : 31
% 0.45/1.64 # Clause-clause subsumption calls (NU) : 3668
% 0.45/1.64 # Rec. Clause-clause subsumption calls : 1929
% 0.45/1.64 # Non-unit clause-clause subsumptions : 115
% 0.45/1.64 # Unit Clause-clause subsumption calls : 967
% 0.45/1.64 # Rewrite failures with RHS unbound : 0
% 0.45/1.64 # BW rewrite match attempts : 506
% 0.45/1.64 # BW rewrite match successes : 55
% 0.45/1.64 # Condensation attempts : 0
% 0.45/1.64 # Condensation successes : 0
% 0.45/1.64 # Termbank termtop insertions : 206526
% 0.45/1.64
% 0.45/1.64 # -------------------------------------------------
% 0.45/1.64 # User time : 0.214 s
% 0.45/1.64 # System time : 0.005 s
% 0.45/1.64 # Total time : 0.219 s
% 0.45/1.64 # Maximum resident set size: 14292 pages
%------------------------------------------------------------------------------