TSTP Solution File: NUN073+2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : NUN073+2 : TPTP v8.1.2. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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:10 EDT 2023
% Result : Theorem 0.22s 0.53s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 39 ( 16 unt; 0 def)
% Number of atoms : 107 ( 43 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 130 ( 62 ~; 49 |; 19 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-1 aty)
% Number of variables : 61 ( 2 sgn; 40 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_1,axiom,
? [X1] :
! [X2] :
( ( ~ r1(X2)
& X2 != X1 )
| ( r1(X2)
& X2 = X1 ) ),
file('/export/starexec/sandbox/tmp/tmp.oTqMvz31F9/E---3.1_7591.p',axiom_1) ).
fof(oneuneqtwo,conjecture,
! [X39] :
( ! [X22] :
( ! [X16] :
( ~ r1(X16)
| ~ r2(X16,X22) )
| X22 != X39 )
| ! [X23] :
( ! [X17] :
( ~ r1(X17)
| ~ r2(X17,X23) )
| ~ r2(X23,X39) ) ),
file('/export/starexec/sandbox/tmp/tmp.oTqMvz31F9/E---3.1_7591.p',oneuneqtwo) ).
fof(axiom_2,axiom,
! [X3] :
? [X4] :
! [X5] :
( ( ~ r2(X3,X5)
& X5 != X4 )
| ( r2(X3,X5)
& X5 = X4 ) ),
file('/export/starexec/sandbox/tmp/tmp.oTqMvz31F9/E---3.1_7591.p',axiom_2) ).
fof(axiom_3a,axiom,
! [X26,X27] :
( ! [X28] :
( ! [X29] :
( ~ r2(X26,X29)
| X29 != X28 )
| ~ r2(X27,X28) )
| X26 = X27 ),
file('/export/starexec/sandbox/tmp/tmp.oTqMvz31F9/E---3.1_7591.p',axiom_3a) ).
fof(axiom_7a,axiom,
! [X41,X42] :
( ! [X43] :
( ~ r1(X43)
| X43 != X42 )
| ~ r2(X41,X42) ),
file('/export/starexec/sandbox/tmp/tmp.oTqMvz31F9/E---3.1_7591.p',axiom_7a) ).
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,
~ ! [X39] :
( ! [X22] :
( ! [X16] :
( ~ r1(X16)
| ~ r2(X16,X22) )
| X22 != X39 )
| ! [X23] :
( ! [X17] :
( ~ r1(X17)
| ~ r2(X17,X23) )
| ~ r2(X23,X39) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[oneuneqtwo])]) ).
fof(c_0_7,plain,
! [X76] :
( ( r1(X76)
| ~ r1(X76) )
& ( X76 = esk18_0
| ~ r1(X76) )
& ( r1(X76)
| X76 != esk18_0 )
& ( X76 = esk18_0
| X76 != esk18_0 ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_5])])]) ).
fof(c_0_8,negated_conjecture,
( r1(esk3_0)
& r2(esk3_0,esk2_0)
& esk2_0 = esk1_0
& r1(esk5_0)
& r2(esk5_0,esk4_0)
& r2(esk4_0,esk1_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
fof(c_0_9,plain,
! [X3] :
? [X4] :
! [X5] :
( ( ~ r2(X3,X5)
& X5 != X4 )
| ( r2(X3,X5)
& X5 = X4 ) ),
inference(fof_simplification,[status(thm)],[axiom_2]) ).
cnf(c_0_10,plain,
( X1 = esk18_0
| ~ r1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
r1(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_12,plain,
! [X26,X27] :
( ! [X28] :
( ! [X29] :
( ~ r2(X26,X29)
| X29 != X28 )
| ~ r2(X27,X28) )
| X26 = X27 ),
inference(fof_simplification,[status(thm)],[axiom_3a]) ).
fof(c_0_13,plain,
! [X49,X51] :
( ( r2(X49,X51)
| ~ r2(X49,X51) )
& ( X51 = esk6_1(X49)
| ~ r2(X49,X51) )
& ( r2(X49,X51)
| X51 != esk6_1(X49) )
& ( X51 = esk6_1(X49)
| X51 != esk6_1(X49) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_9])])]) ).
cnf(c_0_14,negated_conjecture,
esk18_0 = esk5_0,
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,negated_conjecture,
r2(esk3_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_16,negated_conjecture,
esk2_0 = esk1_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_17,plain,
! [X64,X65,X66,X67] :
( ~ r2(X64,X67)
| X67 != X66
| ~ r2(X65,X66)
| X64 = X65 ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_12])]) ).
cnf(c_0_18,plain,
( X1 = esk6_1(X2)
| ~ r2(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,negated_conjecture,
r2(esk5_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_20,plain,
( X1 = esk5_0
| ~ r1(X1) ),
inference(rw,[status(thm)],[c_0_10,c_0_14]) ).
cnf(c_0_21,negated_conjecture,
r1(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_22,negated_conjecture,
r2(esk3_0,esk1_0),
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
fof(c_0_23,plain,
! [X41,X42] :
( ! [X43] :
( ~ r1(X43)
| X43 != X42 )
| ~ r2(X41,X42) ),
inference(fof_simplification,[status(thm)],[axiom_7a]) ).
cnf(c_0_24,plain,
( X1 = X4
| ~ r2(X1,X2)
| X2 != X3
| ~ r2(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,negated_conjecture,
esk6_1(esk5_0) = esk4_0,
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_26,negated_conjecture,
esk5_0 = esk3_0,
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,negated_conjecture,
esk6_1(esk3_0) = esk1_0,
inference(spm,[status(thm)],[c_0_18,c_0_22]) ).
fof(c_0_28,plain,
! [X72,X73,X74] :
( ~ r1(X74)
| X74 != X73
| ~ r2(X72,X73) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_23])]) ).
cnf(c_0_29,plain,
( X1 = X2
| ~ r2(X2,X3)
| ~ r2(X1,X3) ),
inference(er,[status(thm)],[c_0_24]) ).
cnf(c_0_30,negated_conjecture,
r2(esk4_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_31,negated_conjecture,
esk4_0 = esk1_0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).
cnf(c_0_32,plain,
( ~ r1(X1)
| X1 != X2
| ~ r2(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_33,negated_conjecture,
( X1 = esk3_0
| ~ r2(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_29,c_0_22]) ).
cnf(c_0_34,negated_conjecture,
r2(esk1_0,esk1_0),
inference(rw,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,plain,
( ~ r2(X1,X2)
| ~ r1(X2) ),
inference(er,[status(thm)],[c_0_32]) ).
cnf(c_0_36,negated_conjecture,
esk3_0 = esk1_0,
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_37,negated_conjecture,
~ r1(esk1_0),
inference(spm,[status(thm)],[c_0_35,c_0_30]) ).
cnf(c_0_38,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_36]),c_0_37]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14 % Problem : NUN073+2 : TPTP v8.1.2. Released v7.3.0.
% 0.07/0.15 % Command : run_E %s %d THM
% 0.15/0.37 % Computer : n019.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 2400
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Mon Oct 2 20:48:06 EDT 2023
% 0.15/0.37 % CPUTime :
% 0.22/0.51 Running first-order theorem proving
% 0.22/0.51 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.oTqMvz31F9/E---3.1_7591.p
% 0.22/0.53 # Version: 3.1pre001
% 0.22/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.53 # Starting sh5l with 300s (1) cores
% 0.22/0.53 # sh5l with pid 7672 completed with status 0
% 0.22/0.53 # Result found by sh5l
% 0.22/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.53 # Starting sh5l with 300s (1) cores
% 0.22/0.53 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.22/0.53 # Search class: FGHSM-FFMM21-SFFFFFNN
% 0.22/0.53 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.53 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 163s (1) cores
% 0.22/0.53 # G-E--_200_B02_F1_SE_CS_SP_PI_S0S with pid 7673 completed with status 0
% 0.22/0.53 # Result found by G-E--_200_B02_F1_SE_CS_SP_PI_S0S
% 0.22/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.53 # Starting sh5l with 300s (1) cores
% 0.22/0.53 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.22/0.53 # Search class: FGHSM-FFMM21-SFFFFFNN
% 0.22/0.53 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.53 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 163s (1) cores
% 0.22/0.53 # Preprocessing time : 0.001 s
% 0.22/0.53
% 0.22/0.53 # Proof found!
% 0.22/0.53 # SZS status Theorem
% 0.22/0.53 # SZS output start CNFRefutation
% See solution above
% 0.22/0.53 # Parsed axioms : 12
% 0.22/0.53 # Removed by relevancy pruning/SinE : 0
% 0.22/0.53 # Initial clauses : 45
% 0.22/0.53 # Removed in clause preprocessing : 8
% 0.22/0.53 # Initial clauses in saturation : 37
% 0.22/0.53 # Processed clauses : 76
% 0.22/0.53 # ...of these trivial : 3
% 0.22/0.53 # ...subsumed : 5
% 0.22/0.53 # ...remaining for further processing : 68
% 0.22/0.53 # Other redundant clauses eliminated : 6
% 0.22/0.53 # Clauses deleted for lack of memory : 0
% 0.22/0.53 # Backward-subsumed : 0
% 0.22/0.53 # Backward-rewritten : 17
% 0.22/0.53 # Generated clauses : 84
% 0.22/0.53 # ...of the previous two non-redundant : 91
% 0.22/0.53 # ...aggressively subsumed : 0
% 0.22/0.53 # Contextual simplify-reflections : 0
% 0.22/0.53 # Paramodulations : 78
% 0.22/0.53 # Factorizations : 0
% 0.22/0.53 # NegExts : 0
% 0.22/0.53 # Equation resolutions : 6
% 0.22/0.53 # Total rewrite steps : 39
% 0.22/0.53 # Propositional unsat checks : 0
% 0.22/0.53 # Propositional check models : 0
% 0.22/0.53 # Propositional check unsatisfiable : 0
% 0.22/0.53 # Propositional clauses : 0
% 0.22/0.53 # Propositional clauses after purity: 0
% 0.22/0.53 # Propositional unsat core size : 0
% 0.22/0.53 # Propositional preprocessing time : 0.000
% 0.22/0.53 # Propositional encoding time : 0.000
% 0.22/0.53 # Propositional solver time : 0.000
% 0.22/0.53 # Success case prop preproc time : 0.000
% 0.22/0.53 # Success case prop encoding time : 0.000
% 0.22/0.53 # Success case prop solver time : 0.000
% 0.22/0.53 # Current number of processed clauses : 45
% 0.22/0.53 # Positive orientable unit clauses : 27
% 0.22/0.53 # Positive unorientable unit clauses: 0
% 0.22/0.53 # Negative unit clauses : 5
% 0.22/0.53 # Non-unit-clauses : 13
% 0.22/0.53 # Current number of unprocessed clauses: 45
% 0.22/0.53 # ...number of literals in the above : 66
% 0.22/0.53 # Current number of archived formulas : 0
% 0.22/0.53 # Current number of archived clauses : 17
% 0.22/0.53 # Clause-clause subsumption calls (NU) : 24
% 0.22/0.53 # Rec. Clause-clause subsumption calls : 21
% 0.22/0.53 # Non-unit clause-clause subsumptions : 0
% 0.22/0.53 # Unit Clause-clause subsumption calls : 43
% 0.22/0.53 # Rewrite failures with RHS unbound : 0
% 0.22/0.53 # BW rewrite match attempts : 14
% 0.22/0.53 # BW rewrite match successes : 5
% 0.22/0.53 # Condensation attempts : 0
% 0.22/0.53 # Condensation successes : 0
% 0.22/0.53 # Termbank termtop insertions : 1907
% 0.22/0.53
% 0.22/0.53 # -------------------------------------------------
% 0.22/0.53 # User time : 0.006 s
% 0.22/0.53 # System time : 0.002 s
% 0.22/0.53 # Total time : 0.008 s
% 0.22/0.53 # Maximum resident set size: 1852 pages
% 0.22/0.53
% 0.22/0.53 # -------------------------------------------------
% 0.22/0.53 # User time : 0.008 s
% 0.22/0.53 # System time : 0.003 s
% 0.22/0.53 # Total time : 0.011 s
% 0.22/0.53 # Maximum resident set size: 1716 pages
% 0.22/0.53 % E---3.1 exiting
% 0.22/0.53 % E---3.1 exiting
%------------------------------------------------------------------------------