TSTP Solution File: NUN067+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUN067+2 : TPTP v8.1.0. Released v7.3.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 : Mon Jul 18 16:26:03 EDT 2022
% Result : Theorem 0.24s 1.43s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 19 ( 6 unt; 0 def)
% Number of atoms : 51 ( 23 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 62 ( 30 ~; 21 |; 11 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 34 ( 8 sgn 15 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(nonzerosexist,conjecture,
? [X39] :
! [X22] :
( ~ r1(X22)
| X39 != X22 ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',nonzerosexist) ).
fof(axiom_1,axiom,
? [X1] :
! [X2] :
( ( ~ r1(X2)
& X2 != X1 )
| ( r1(X2)
& X2 = X1 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM008+0.ax',axiom_1) ).
fof(axiom_7a,axiom,
! [X41,X42] :
( ! [X43] :
( ~ r1(X43)
| X43 != X42 )
| ~ r2(X41,X42) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM008+0.ax',axiom_7a) ).
fof(axiom_2,axiom,
! [X3] :
? [X4] :
! [X5] :
( ( ~ r2(X3,X5)
& X5 != X4 )
| ( r2(X3,X5)
& X5 = X4 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM008+0.ax',axiom_2) ).
fof(c_0_4,negated_conjecture,
~ ? [X39] :
! [X22] :
( ~ r1(X22)
| X39 != X22 ),
inference(assume_negation,[status(cth)],[nonzerosexist]) ).
fof(c_0_5,negated_conjecture,
! [X40] :
( r1(esk1_1(X40))
& X40 = esk1_1(X40) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_4])])])]) ).
fof(c_0_6,plain,
! [X4] :
( ( r1(X4)
| ~ r1(X4) )
& ( X4 = esk2_0
| ~ r1(X4) )
& ( r1(X4)
| X4 != esk2_0 )
& ( X4 = esk2_0
| X4 != esk2_0 ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[axiom_1])])])]) ).
cnf(c_0_7,negated_conjecture,
r1(esk1_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
X1 = esk1_1(X1),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_9,plain,
! [X44,X45,X46] :
( ~ r1(X46)
| X46 != X45
| ~ r2(X44,X45) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[axiom_7a])])])])]) ).
fof(c_0_10,plain,
! [X6,X8] :
( ( r2(X6,X8)
| ~ r2(X6,X8) )
& ( X8 = esk6_1(X6)
| ~ r2(X6,X8) )
& ( r2(X6,X8)
| X8 != esk6_1(X6) )
& ( X8 = esk6_1(X6)
| X8 != esk6_1(X6) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[axiom_2])])])]) ).
cnf(c_0_11,plain,
( X1 = esk2_0
| ~ r1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,negated_conjecture,
r1(X1),
inference(rw,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_13,plain,
( ~ r2(X1,X2)
| X3 != X2
| ~ r1(X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( r2(X2,X1)
| X1 != esk6_1(X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
X1 = esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12])]) ).
cnf(c_0_16,plain,
( X2 != X3
| ~ r2(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_12])]) ).
cnf(c_0_17,plain,
r2(X1,X2),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15]),c_0_15]) ).
cnf(c_0_18,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_16]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : NUN067+2 : TPTP v8.1.0. Released v7.3.0.
% 0.08/0.14 % Command : run_ET %s %d
% 0.14/0.35 % Computer : n020.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 : Thu Jun 2 04:38:38 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 : 19
% 0.24/1.43 # Proof object clause steps : 10
% 0.24/1.43 # Proof object formula steps : 9
% 0.24/1.43 # Proof object conjectures : 6
% 0.24/1.43 # Proof object clause conjectures : 3
% 0.24/1.43 # Proof object formula conjectures : 3
% 0.24/1.43 # Proof object initial clauses used : 5
% 0.24/1.43 # Proof object initial formulas used : 4
% 0.24/1.43 # Proof object generating inferences : 0
% 0.24/1.43 # Proof object simplifying inferences : 10
% 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 : 6
% 0.24/1.43 # Initial clauses : 16
% 0.24/1.43 # Removed in clause preprocessing : 9
% 0.24/1.43 # Initial clauses in saturation : 7
% 0.24/1.43 # Processed clauses : 11
% 0.24/1.43 # ...of these trivial : 1
% 0.24/1.43 # ...subsumed : 4
% 0.24/1.43 # ...remaining for further processing : 5
% 0.24/1.43 # Other redundant clauses eliminated : 2
% 0.24/1.43 # Clauses deleted for lack of memory : 0
% 0.24/1.43 # Backward-subsumed : 1
% 0.24/1.43 # Backward-rewritten : 0
% 0.24/1.43 # Generated clauses : 4
% 0.24/1.43 # ...of the previous two non-trivial : 4
% 0.24/1.43 # Contextual simplify-reflections : 0
% 0.24/1.43 # Paramodulations : 2
% 0.24/1.43 # Factorizations : 0
% 0.24/1.43 # Equation resolutions : 2
% 0.24/1.43 # Current number of processed clauses : 2
% 0.24/1.43 # Positive orientable unit clauses : 1
% 0.24/1.43 # Positive unorientable unit clauses: 1
% 0.24/1.43 # Negative unit clauses : 0
% 0.24/1.43 # Non-unit-clauses : 0
% 0.24/1.43 # Current number of unprocessed clauses: 0
% 0.24/1.43 # ...number of literals in the above : 0
% 0.24/1.43 # Current number of archived formulas : 0
% 0.24/1.43 # Current number of archived clauses : 3
% 0.24/1.43 # Clause-clause subsumption calls (NU) : 0
% 0.24/1.43 # Rec. Clause-clause subsumption calls : 0
% 0.24/1.43 # Non-unit clause-clause subsumptions : 0
% 0.24/1.43 # Unit Clause-clause subsumption calls : 2
% 0.24/1.43 # Rewrite failures with RHS unbound : 3
% 0.24/1.43 # BW rewrite match attempts : 2
% 0.24/1.43 # BW rewrite match successes : 2
% 0.24/1.43 # Condensation attempts : 0
% 0.24/1.43 # Condensation successes : 0
% 0.24/1.43 # Termbank termtop insertions : 586
% 0.24/1.43
% 0.24/1.43 # -------------------------------------------------
% 0.24/1.43 # User time : 0.013 s
% 0.24/1.43 # System time : 0.002 s
% 0.24/1.43 # Total time : 0.015 s
% 0.24/1.43 # Maximum resident set size: 2848 pages
%------------------------------------------------------------------------------