TSTP Solution File: NUN062+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUN062+1 : TPTP v8.1.0. Bugfixed v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n023.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:01 EDT 2022
% Result : Theorem 0.24s 1.41s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 37 ( 11 unt; 0 def)
% Number of atoms : 101 ( 0 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 115 ( 51 ~; 42 |; 22 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 1 con; 0-2 aty)
% Number of variables : 85 ( 7 sgn 35 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(infiniteNumbersid,conjecture,
! [X38] :
? [X46,X63] :
( ! [X40] :
( ~ id(X63,X40)
| ~ r1(X40) )
& ? [X47] :
( id(X47,X46)
& r3(X38,X63,X47) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',infiniteNumbersid) ).
fof(axiom_6,axiom,
! [X15,X16] :
( ~ id(X15,X16)
| id(X16,X15) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM009+0.ax',axiom_6) ).
fof(axiom_4a,axiom,
! [X54] :
? [X55] :
( id(X55,X54)
& ? [X56] :
( r1(X56)
& r3(X54,X56,X55) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM009+0.ax',axiom_4a) ).
fof(axiom_1a,axiom,
! [X38,X39] :
? [X40] :
( ? [X41] :
( id(X41,X40)
& ? [X42] :
( r2(X39,X42)
& r3(X38,X42,X41) ) )
& ? [X43] :
( r2(X43,X40)
& r3(X38,X39,X43) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM009+0.ax',axiom_1a) ).
fof(axiom_7,axiom,
! [X17,X18,X19] :
( ~ id(X17,X18)
| id(X17,X19)
| ~ id(X18,X19) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM009+0.ax',axiom_7) ).
fof(axiom_7a,axiom,
! [X65,X66] :
( ! [X67] :
( ~ id(X67,X66)
| ~ r1(X67) )
| ~ r2(X65,X66) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM009+0.ax',axiom_7a) ).
fof(axiom_8,axiom,
! [X20,X21] :
( ~ id(X20,X21)
| ( ~ r1(X20)
& ~ r1(X21) )
| ( r1(X20)
& r1(X21) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM009+0.ax',axiom_8) ).
fof(axiom_5,axiom,
! [X14] : id(X14,X14),
file('/export/starexec/sandbox/benchmark/Axioms/NUM009+0.ax',axiom_5) ).
fof(c_0_8,negated_conjecture,
~ ! [X38] :
? [X46,X63] :
( ! [X40] :
( ~ id(X63,X40)
| ~ r1(X40) )
& ? [X47] :
( id(X47,X46)
& r3(X38,X63,X47) ) ),
inference(assume_negation,[status(cth)],[infiniteNumbersid]) ).
fof(c_0_9,plain,
! [X17,X18] :
( ~ id(X17,X18)
| id(X18,X17) ),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[axiom_6])]) ).
fof(c_0_10,plain,
! [X57] :
( id(esk8_1(X57),X57)
& r1(esk9_1(X57))
& r3(X57,esk9_1(X57),esk8_1(X57)) ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[axiom_4a])])])]) ).
fof(c_0_11,negated_conjecture,
! [X65,X66,X68] :
( ( id(X66,esk2_2(X65,X66))
| ~ id(X68,X65)
| ~ r3(esk1_0,X66,X68) )
& ( r1(esk2_2(X65,X66))
| ~ id(X68,X65)
| ~ r3(esk1_0,X66,X68) ) ),
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_8])])])])])])])]) ).
fof(c_0_12,plain,
! [X44,X45] :
( id(esk5_2(X44,X45),esk4_2(X44,X45))
& r2(X45,esk6_2(X44,X45))
& r3(X44,esk6_2(X44,X45),esk5_2(X44,X45))
& r2(esk7_2(X44,X45),esk4_2(X44,X45))
& r3(X44,X45,esk7_2(X44,X45)) ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[axiom_1a])])])]) ).
fof(c_0_13,plain,
! [X20,X21,X22] :
( ~ id(X20,X21)
| id(X20,X22)
| ~ id(X21,X22) ),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[axiom_7])]) ).
cnf(c_0_14,plain,
( id(X1,X2)
| ~ id(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
id(esk8_1(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_16,plain,
! [X68,X69,X70] :
( ~ id(X70,X69)
| ~ r1(X70)
| ~ r2(X68,X69) ),
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_17,plain,
! [X22,X23] :
( ( r1(X22)
| ~ r1(X22)
| ~ id(X22,X23) )
& ( r1(X23)
| ~ r1(X22)
| ~ id(X22,X23) )
& ( r1(X22)
| ~ r1(X23)
| ~ id(X22,X23) )
& ( r1(X23)
| ~ r1(X23)
| ~ id(X22,X23) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[axiom_8])])]) ).
cnf(c_0_18,negated_conjecture,
( id(X1,esk2_2(X3,X1))
| ~ r3(esk1_0,X1,X2)
| ~ id(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_19,plain,
r3(X1,X2,esk7_2(X1,X2)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,negated_conjecture,
( r1(esk2_2(X3,X1))
| ~ r3(esk1_0,X1,X2)
| ~ id(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_21,plain,
( id(X3,X2)
| ~ id(X1,X2)
| ~ id(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_22,plain,
id(X1,esk8_1(X1)),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_23,plain,
( ~ r2(X1,X2)
| ~ r1(X3)
| ~ id(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,plain,
r2(esk7_2(X1,X2),esk4_2(X1,X2)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_25,plain,
! [X15] : id(X15,X15),
inference(variable_rename,[status(thm)],[axiom_5]) ).
cnf(c_0_26,plain,
( r1(X1)
| ~ id(X1,X2)
| ~ r1(X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_27,negated_conjecture,
( id(X1,esk2_2(X2,X1))
| ~ id(esk7_2(esk1_0,X1),X2) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_28,negated_conjecture,
( r1(esk2_2(X1,X2))
| ~ id(esk7_2(esk1_0,X2),X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_19]) ).
cnf(c_0_29,plain,
( id(X1,X2)
| ~ id(esk8_1(X1),X2) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_30,plain,
( ~ r1(X1)
| ~ id(X1,esk4_2(X2,X3)) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_31,plain,
id(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_32,negated_conjecture,
( r1(X1)
| ~ id(esk7_2(esk1_0,X1),X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]) ).
cnf(c_0_33,plain,
id(X1,esk8_1(esk8_1(X1))),
inference(spm,[status(thm)],[c_0_29,c_0_22]) ).
cnf(c_0_34,plain,
~ r1(esk4_2(X1,X2)),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,negated_conjecture,
r1(X1),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_36,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_35])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUN062+1 : TPTP v8.1.0. Bugfixed v7.4.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n023.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 : Thu Jun 2 04:37:56 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.24/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.41 # Preprocessing time : 0.017 s
% 0.24/1.41
% 0.24/1.41 # Proof found!
% 0.24/1.41 # SZS status Theorem
% 0.24/1.41 # SZS output start CNFRefutation
% See solution above
% 0.24/1.41 # Proof object total steps : 37
% 0.24/1.41 # Proof object clause steps : 20
% 0.24/1.41 # Proof object formula steps : 17
% 0.24/1.41 # Proof object conjectures : 9
% 0.24/1.41 # Proof object clause conjectures : 6
% 0.24/1.41 # Proof object formula conjectures : 3
% 0.24/1.41 # Proof object initial clauses used : 10
% 0.24/1.41 # Proof object initial formulas used : 8
% 0.24/1.41 # Proof object generating inferences : 9
% 0.24/1.41 # Proof object simplifying inferences : 3
% 0.24/1.41 # Training examples: 0 positive, 0 negative
% 0.24/1.41 # Parsed axioms : 19
% 0.24/1.41 # Removed by relevancy pruning/SinE : 4
% 0.24/1.41 # Initial clauses : 43
% 0.24/1.41 # Removed in clause preprocessing : 12
% 0.24/1.41 # Initial clauses in saturation : 31
% 0.24/1.41 # Processed clauses : 557
% 0.24/1.41 # ...of these trivial : 25
% 0.24/1.41 # ...subsumed : 167
% 0.24/1.41 # ...remaining for further processing : 365
% 0.24/1.41 # Other redundant clauses eliminated : 0
% 0.24/1.41 # Clauses deleted for lack of memory : 0
% 0.24/1.41 # Backward-subsumed : 5
% 0.24/1.41 # Backward-rewritten : 115
% 0.24/1.41 # Generated clauses : 5054
% 0.24/1.41 # ...of the previous two non-trivial : 4215
% 0.24/1.41 # Contextual simplify-reflections : 4
% 0.24/1.41 # Paramodulations : 5054
% 0.24/1.41 # Factorizations : 0
% 0.24/1.41 # Equation resolutions : 0
% 0.24/1.41 # Current number of processed clauses : 245
% 0.24/1.41 # Positive orientable unit clauses : 122
% 0.24/1.41 # Positive unorientable unit clauses: 0
% 0.24/1.41 # Negative unit clauses : 13
% 0.24/1.41 # Non-unit-clauses : 110
% 0.24/1.41 # Current number of unprocessed clauses: 2464
% 0.24/1.41 # ...number of literals in the above : 5867
% 0.24/1.41 # Current number of archived formulas : 0
% 0.24/1.41 # Current number of archived clauses : 120
% 0.24/1.41 # Clause-clause subsumption calls (NU) : 6424
% 0.24/1.41 # Rec. Clause-clause subsumption calls : 4908
% 0.24/1.41 # Non-unit clause-clause subsumptions : 125
% 0.24/1.41 # Unit Clause-clause subsumption calls : 1635
% 0.24/1.41 # Rewrite failures with RHS unbound : 0
% 0.24/1.41 # BW rewrite match attempts : 174
% 0.24/1.41 # BW rewrite match successes : 53
% 0.24/1.41 # Condensation attempts : 0
% 0.24/1.41 # Condensation successes : 0
% 0.24/1.41 # Termbank termtop insertions : 57689
% 0.24/1.41
% 0.24/1.41 # -------------------------------------------------
% 0.24/1.41 # User time : 0.109 s
% 0.24/1.41 # System time : 0.008 s
% 0.24/1.41 # Total time : 0.117 s
% 0.24/1.41 # Maximum resident set size: 6192 pages
%------------------------------------------------------------------------------