TSTP Solution File: NUN067+2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : NUN067+2 : TPTP v8.1.2. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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:09 EDT 2023
% Result : Theorem 0.21s 0.50s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 21 ( 6 unt; 0 def)
% Number of atoms : 60 ( 27 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 75 ( 36 ~; 24 |; 15 &)
% ( 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 : 39 ( 6 sgn; 21 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(nonzerosexist,conjecture,
? [X39] :
! [X22] :
( ~ r1(X22)
| X39 != X22 ),
file('/export/starexec/sandbox/tmp/tmp.6lBW4PGHxy/E---3.1_5860.p',nonzerosexist) ).
fof(axiom_1,axiom,
? [X1] :
! [X2] :
( ( ~ r1(X2)
& X2 != X1 )
| ( r1(X2)
& X2 = X1 ) ),
file('/export/starexec/sandbox/tmp/tmp.6lBW4PGHxy/E---3.1_5860.p',axiom_1) ).
fof(axiom_7a,axiom,
! [X41,X42] :
( ! [X43] :
( ~ r1(X43)
| X43 != X42 )
| ~ r2(X41,X42) ),
file('/export/starexec/sandbox/tmp/tmp.6lBW4PGHxy/E---3.1_5860.p',axiom_7a) ).
fof(axiom_2,axiom,
! [X3] :
? [X4] :
! [X5] :
( ( ~ r2(X3,X5)
& X5 != X4 )
| ( r2(X3,X5)
& X5 = X4 ) ),
file('/export/starexec/sandbox/tmp/tmp.6lBW4PGHxy/E---3.1_5860.p',axiom_2) ).
fof(c_0_4,negated_conjecture,
~ ? [X39] :
! [X22] :
( ~ r1(X22)
| X39 != X22 ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[nonzerosexist])]) ).
fof(c_0_5,plain,
? [X1] :
! [X2] :
( ( ~ r1(X2)
& X2 != X1 )
| ( r1(X2)
& X2 = X1 ) ),
inference(fof_simplification,[status(thm)],[axiom_1]) ).
fof(c_0_6,negated_conjecture,
! [X44] :
( r1(esk1_1(X44))
& X44 = esk1_1(X44) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
fof(c_0_7,plain,
! [X41,X42] :
( ! [X43] :
( ~ r1(X43)
| X43 != X42 )
| ~ r2(X41,X42) ),
inference(fof_simplification,[status(thm)],[axiom_7a]) ).
fof(c_0_8,plain,
! [X3] :
? [X4] :
! [X5] :
( ( ~ r2(X3,X5)
& X5 != X4 )
| ( r2(X3,X5)
& X5 = X4 ) ),
inference(fof_simplification,[status(thm)],[axiom_2]) ).
fof(c_0_9,plain,
! [X47] :
( ( r1(X47)
| ~ r1(X47) )
& ( X47 = esk2_0
| ~ r1(X47) )
& ( r1(X47)
| X47 != esk2_0 )
& ( X47 = esk2_0
| X47 != esk2_0 ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_5])])]) ).
cnf(c_0_10,negated_conjecture,
r1(esk1_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,negated_conjecture,
X1 = esk1_1(X1),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_12,plain,
! [X55,X56,X57] :
( ~ r1(X57)
| X57 != X56
| ~ r2(X55,X56) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_7])]) ).
fof(c_0_13,plain,
! [X74,X76] :
( ( r2(X74,X76)
| ~ r2(X74,X76) )
& ( X76 = esk17_1(X74)
| ~ r2(X74,X76) )
& ( r2(X74,X76)
| X76 != esk17_1(X74) )
& ( X76 = esk17_1(X74)
| X76 != esk17_1(X74) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_8])])]) ).
cnf(c_0_14,plain,
( X1 = esk2_0
| ~ r1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,negated_conjecture,
r1(X1),
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,plain,
( ~ r1(X1)
| X1 != X2
| ~ r2(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
( r2(X1,X2)
| X2 != esk17_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
X1 = esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15])]) ).
cnf(c_0_19,plain,
~ r2(X1,X2),
inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_15])])]) ).
cnf(c_0_20,plain,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18]),c_0_18]),c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.13 % Problem : NUN067+2 : TPTP v8.1.2. Released v7.3.0.
% 0.10/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n017.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 : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Oct 2 20:14:11 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.6lBW4PGHxy/E---3.1_5860.p
% 0.21/0.50 # Version: 3.1pre001
% 0.21/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.50 # Starting sh5l with 300s (1) cores
% 0.21/0.50 # new_bool_3 with pid 5968 completed with status 0
% 0.21/0.50 # Result found by new_bool_3
% 0.21/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.50 # Search class: FGHSM-FFMF21-SFFFFFNN
% 0.21/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4b with 181s (1) cores
% 0.21/0.50 # G-E--_208_C18_F1_SE_CS_SP_PS_S4b with pid 5974 completed with status 0
% 0.21/0.50 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S4b
% 0.21/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.50 # Search class: FGHSM-FFMF21-SFFFFFNN
% 0.21/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4b with 181s (1) cores
% 0.21/0.50 # Preprocessing time : 0.001 s
% 0.21/0.50 # Presaturation interreduction done
% 0.21/0.50
% 0.21/0.50 # Proof found!
% 0.21/0.50 # SZS status Theorem
% 0.21/0.50 # SZS output start CNFRefutation
% See solution above
% 0.21/0.50 # Parsed axioms : 12
% 0.21/0.50 # Removed by relevancy pruning/SinE : 0
% 0.21/0.50 # Initial clauses : 41
% 0.21/0.50 # Removed in clause preprocessing : 8
% 0.21/0.50 # Initial clauses in saturation : 33
% 0.21/0.50 # Processed clauses : 17
% 0.21/0.50 # ...of these trivial : 8
% 0.21/0.50 # ...subsumed : 3
% 0.21/0.50 # ...remaining for further processing : 5
% 0.21/0.50 # Other redundant clauses eliminated : 1
% 0.21/0.50 # Clauses deleted for lack of memory : 0
% 0.21/0.50 # Backward-subsumed : 0
% 0.21/0.50 # Backward-rewritten : 1
% 0.21/0.50 # Generated clauses : 1
% 0.21/0.50 # ...of the previous two non-redundant : 2
% 0.21/0.50 # ...aggressively subsumed : 0
% 0.21/0.50 # Contextual simplify-reflections : 0
% 0.21/0.50 # Paramodulations : 0
% 0.21/0.50 # Factorizations : 0
% 0.21/0.50 # NegExts : 0
% 0.21/0.50 # Equation resolutions : 1
% 0.21/0.50 # Total rewrite steps : 24
% 0.21/0.50 # Propositional unsat checks : 0
% 0.21/0.50 # Propositional check models : 0
% 0.21/0.50 # Propositional check unsatisfiable : 0
% 0.21/0.50 # Propositional clauses : 0
% 0.21/0.50 # Propositional clauses after purity: 0
% 0.21/0.50 # Propositional unsat core size : 0
% 0.21/0.50 # Propositional preprocessing time : 0.000
% 0.21/0.50 # Propositional encoding time : 0.000
% 0.21/0.50 # Propositional solver time : 0.000
% 0.21/0.50 # Success case prop preproc time : 0.000
% 0.21/0.50 # Success case prop encoding time : 0.000
% 0.21/0.50 # Success case prop solver time : 0.000
% 0.21/0.50 # Current number of processed clauses : 3
% 0.21/0.50 # Positive orientable unit clauses : 1
% 0.21/0.50 # Positive unorientable unit clauses: 1
% 0.21/0.50 # Negative unit clauses : 1
% 0.21/0.50 # Non-unit-clauses : 0
% 0.21/0.50 # Current number of unprocessed clauses: 18
% 0.21/0.50 # ...number of literals in the above : 28
% 0.21/0.50 # Current number of archived formulas : 0
% 0.21/0.50 # Current number of archived clauses : 1
% 0.21/0.50 # Clause-clause subsumption calls (NU) : 0
% 0.21/0.50 # Rec. Clause-clause subsumption calls : 0
% 0.21/0.50 # Non-unit clause-clause subsumptions : 0
% 0.21/0.50 # Unit Clause-clause subsumption calls : 0
% 0.21/0.50 # Rewrite failures with RHS unbound : 4
% 0.21/0.50 # BW rewrite match attempts : 3
% 0.21/0.50 # BW rewrite match successes : 1
% 0.21/0.50 # Condensation attempts : 0
% 0.21/0.50 # Condensation successes : 0
% 0.21/0.50 # Termbank termtop insertions : 1039
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.006 s
% 0.21/0.50 # System time : 0.001 s
% 0.21/0.50 # Total time : 0.007 s
% 0.21/0.50 # Maximum resident set size: 1868 pages
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.006 s
% 0.21/0.50 # System time : 0.005 s
% 0.21/0.50 # Total time : 0.011 s
% 0.21/0.50 # Maximum resident set size: 1744 pages
% 0.21/0.50 % E---3.1 exiting
% 0.21/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------