TSTP Solution File: NUN062+2 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : NUN062+2 : TPTP v8.1.2. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:09:23 EDT 2023
% Result : Theorem 0.15s 0.42s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 20 ( 5 unt; 0 def)
% Number of atoms : 55 ( 17 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 66 ( 31 ~; 22 |; 13 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-2 aty)
% Number of variables : 54 ( 7 sgn; 20 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(infiniteNumbers,conjecture,
! [X14] :
? [X22,X39] :
( ! [X16] :
( ~ r1(X16)
| X39 != X16 )
& ? [X23] :
( r3(X14,X39,X23)
& X23 = X22 ) ),
file('/export/starexec/sandbox2/tmp/tmp.QXo1Nd7wmf/E---3.1_24668.p',infiniteNumbers) ).
fof(axiom_7a,axiom,
! [X41,X42] :
( ! [X43] :
( ~ r1(X43)
| X43 != X42 )
| ~ r2(X41,X42) ),
file('/export/starexec/sandbox2/tmp/tmp.QXo1Nd7wmf/E---3.1_24668.p',axiom_7a) ).
fof(axiom_1a,axiom,
! [X14,X15] :
? [X16] :
( ? [X17] :
( ? [X18] :
( r2(X15,X18)
& r3(X14,X18,X17) )
& X17 = X16 )
& ? [X19] :
( r2(X19,X16)
& r3(X14,X15,X19) ) ),
file('/export/starexec/sandbox2/tmp/tmp.QXo1Nd7wmf/E---3.1_24668.p',axiom_1a) ).
fof(c_0_3,negated_conjecture,
~ ! [X14] :
? [X22,X39] :
( ! [X16] :
( ~ r1(X16)
| X39 != X16 )
& ? [X23] :
( r3(X14,X39,X23)
& X23 = X22 ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[infiniteNumbers])]) ).
fof(c_0_4,plain,
! [X41,X42] :
( ! [X43] :
( ~ r1(X43)
| X43 != X42 )
| ~ r2(X41,X42) ),
inference(fof_simplification,[status(thm)],[axiom_7a]) ).
fof(c_0_5,negated_conjecture,
! [X45,X46,X48] :
( ( r1(esk2_2(X45,X46))
| ~ r3(esk1_0,X46,X48)
| X48 != X45 )
& ( X46 = esk2_2(X45,X46)
| ~ r3(esk1_0,X46,X48)
| X48 != X45 ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])])]) ).
fof(c_0_6,plain,
! [X68,X69,X70] :
( ~ r1(X70)
| X70 != X69
| ~ r2(X68,X69) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_4])]) ).
cnf(c_0_7,negated_conjecture,
( r1(esk2_2(X1,X2))
| ~ r3(esk1_0,X2,X3)
| X3 != X1 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
( X1 = esk2_2(X2,X1)
| ~ r3(esk1_0,X1,X3)
| X3 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( ~ r1(X1)
| X1 != X2
| ~ r2(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_10,plain,
! [X53,X54] :
( r2(X54,esk6_2(X53,X54))
& r3(X53,esk6_2(X53,X54),esk5_2(X53,X54))
& esk5_2(X53,X54) = esk4_2(X53,X54)
& r2(esk7_2(X53,X54),esk4_2(X53,X54))
& r3(X53,X54,esk7_2(X53,X54)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[axiom_1a])]) ).
cnf(c_0_11,negated_conjecture,
( r1(esk2_2(X1,X2))
| ~ r3(esk1_0,X2,X1) ),
inference(er,[status(thm)],[c_0_7]) ).
cnf(c_0_12,negated_conjecture,
( esk2_2(X1,X2) = X2
| ~ r3(esk1_0,X2,X1) ),
inference(er,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( ~ r2(X1,X2)
| ~ r1(X2) ),
inference(er,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
r2(X1,esk6_2(X2,X1)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,negated_conjecture,
( r1(X1)
| ~ r3(esk1_0,X1,X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,plain,
r3(X1,X2,esk7_2(X1,X2)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,plain,
~ r1(esk6_2(X1,X2)),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,negated_conjecture,
r1(X1),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : NUN062+2 : TPTP v8.1.2. Released v7.3.0.
% 0.09/0.10 % Command : run_E %s %d THM
% 0.09/0.30 % Computer : n016.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 2400
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Mon Oct 2 21:15:37 EDT 2023
% 0.09/0.30 % CPUTime :
% 0.15/0.41 Running first-order model finding
% 0.15/0.41 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.QXo1Nd7wmf/E---3.1_24668.p
% 0.15/0.42 # Version: 3.1pre001
% 0.15/0.42 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.42 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.42 # Starting sh5l with 300s (1) cores
% 0.15/0.42 # new_bool_3 with pid 24746 completed with status 0
% 0.15/0.42 # Result found by new_bool_3
% 0.15/0.42 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.42 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.42 # Search class: FGHSM-FFSF21-SFFFFFNN
% 0.15/0.42 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.42 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.15/0.42 # SAT001_MinMin_p005000_rr_RG with pid 24749 completed with status 0
% 0.15/0.42 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.15/0.42 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.42 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.42 # Search class: FGHSM-FFSF21-SFFFFFNN
% 0.15/0.42 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.42 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.15/0.42 # Preprocessing time : 0.001 s
% 0.15/0.42 # Presaturation interreduction done
% 0.15/0.42
% 0.15/0.42 # Proof found!
% 0.15/0.42 # SZS status Theorem
% 0.15/0.42 # SZS output start CNFRefutation
% See solution above
% 0.15/0.42 # Parsed axioms : 12
% 0.15/0.42 # Removed by relevancy pruning/SinE : 3
% 0.15/0.42 # Initial clauses : 28
% 0.15/0.42 # Removed in clause preprocessing : 6
% 0.15/0.42 # Initial clauses in saturation : 22
% 0.15/0.42 # Processed clauses : 51
% 0.15/0.42 # ...of these trivial : 0
% 0.15/0.42 # ...subsumed : 0
% 0.15/0.42 # ...remaining for further processing : 51
% 0.15/0.42 # Other redundant clauses eliminated : 7
% 0.15/0.42 # Clauses deleted for lack of memory : 0
% 0.15/0.42 # Backward-subsumed : 0
% 0.15/0.42 # Backward-rewritten : 9
% 0.15/0.42 # Generated clauses : 18
% 0.15/0.42 # ...of the previous two non-redundant : 18
% 0.15/0.42 # ...aggressively subsumed : 0
% 0.15/0.42 # Contextual simplify-reflections : 0
% 0.15/0.42 # Paramodulations : 11
% 0.15/0.42 # Factorizations : 0
% 0.15/0.42 # NegExts : 0
% 0.15/0.42 # Equation resolutions : 7
% 0.15/0.42 # Total rewrite steps : 12
% 0.15/0.42 # Propositional unsat checks : 0
% 0.15/0.42 # Propositional check models : 0
% 0.15/0.42 # Propositional check unsatisfiable : 0
% 0.15/0.42 # Propositional clauses : 0
% 0.15/0.42 # Propositional clauses after purity: 0
% 0.15/0.42 # Propositional unsat core size : 0
% 0.15/0.42 # Propositional preprocessing time : 0.000
% 0.15/0.42 # Propositional encoding time : 0.000
% 0.15/0.42 # Propositional solver time : 0.000
% 0.15/0.42 # Success case prop preproc time : 0.000
% 0.15/0.42 # Success case prop encoding time : 0.000
% 0.15/0.42 # Success case prop solver time : 0.000
% 0.15/0.42 # Current number of processed clauses : 13
% 0.15/0.42 # Positive orientable unit clauses : 8
% 0.15/0.42 # Positive unorientable unit clauses: 0
% 0.15/0.42 # Negative unit clauses : 0
% 0.15/0.42 # Non-unit-clauses : 5
% 0.15/0.42 # Current number of unprocessed clauses: 9
% 0.15/0.42 # ...number of literals in the above : 15
% 0.15/0.42 # Current number of archived formulas : 0
% 0.15/0.42 # Current number of archived clauses : 31
% 0.15/0.42 # Clause-clause subsumption calls (NU) : 24
% 0.15/0.42 # Rec. Clause-clause subsumption calls : 24
% 0.15/0.42 # Non-unit clause-clause subsumptions : 0
% 0.15/0.42 # Unit Clause-clause subsumption calls : 4
% 0.15/0.42 # Rewrite failures with RHS unbound : 0
% 0.15/0.42 # BW rewrite match attempts : 16
% 0.15/0.42 # BW rewrite match successes : 8
% 0.15/0.42 # Condensation attempts : 0
% 0.15/0.42 # Condensation successes : 0
% 0.15/0.42 # Termbank termtop insertions : 1175
% 0.15/0.42
% 0.15/0.42 # -------------------------------------------------
% 0.15/0.42 # User time : 0.004 s
% 0.15/0.42 # System time : 0.003 s
% 0.15/0.42 # Total time : 0.006 s
% 0.15/0.42 # Maximum resident set size: 1744 pages
% 0.15/0.42
% 0.15/0.42 # -------------------------------------------------
% 0.15/0.42 # User time : 0.005 s
% 0.15/0.42 # System time : 0.004 s
% 0.15/0.42 # Total time : 0.009 s
% 0.15/0.42 # Maximum resident set size: 1716 pages
% 0.15/0.42 % E---3.1 exiting
%------------------------------------------------------------------------------