TSTP Solution File: NUN066+2 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : NUN066+2 : TPTP v8.1.2. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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:24 EDT 2023
% Result : Theorem 0.21s 0.50s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 37 ( 4 unt; 0 def)
% Number of atoms : 115 ( 44 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 135 ( 57 ~; 62 |; 16 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 0 con; 1-1 aty)
% Number of variables : 74 ( 4 sgn; 36 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_3a,axiom,
! [X26,X27] :
( ! [X28] :
( ! [X29] :
( ~ r2(X26,X29)
| X29 != X28 )
| ~ r2(X27,X28) )
| X26 = X27 ),
file('/export/starexec/sandbox/tmp/tmp.qg1ZFnJT0Q/E---3.1_4986.p',axiom_3a) ).
fof(axiom_2,axiom,
! [X3] :
? [X4] :
! [X5] :
( ( ~ r2(X3,X5)
& X5 != X4 )
| ( r2(X3,X5)
& X5 = X4 ) ),
file('/export/starexec/sandbox/tmp/tmp.qg1ZFnJT0Q/E---3.1_4986.p',axiom_2) ).
fof(axiom_7a,axiom,
! [X41,X42] :
( ! [X43] :
( ~ r1(X43)
| X43 != X42 )
| ~ r2(X41,X42) ),
file('/export/starexec/sandbox/tmp/tmp.qg1ZFnJT0Q/E---3.1_4986.p',axiom_7a) ).
fof(nonzerononetwoexist,conjecture,
? [X39] :
( ! [X22] :
( ! [X23] :
( ! [X16] :
( ~ r1(X16)
| ~ r2(X16,X23) )
| ~ r2(X23,X22) )
| X39 != X22 )
& ! [X17] :
( ~ r1(X17)
| X39 != X17 ) ),
file('/export/starexec/sandbox/tmp/tmp.qg1ZFnJT0Q/E---3.1_4986.p',nonzerononetwoexist) ).
fof(c_0_4,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_5,plain,
! [X3] :
? [X4] :
! [X5] :
( ( ~ r2(X3,X5)
& X5 != X4 )
| ( r2(X3,X5)
& X5 = X4 ) ),
inference(fof_simplification,[status(thm)],[axiom_2]) ).
fof(c_0_6,plain,
! [X41,X42] :
( ! [X43] :
( ~ r1(X43)
| X43 != X42 )
| ~ r2(X41,X42) ),
inference(fof_simplification,[status(thm)],[axiom_7a]) ).
fof(c_0_7,plain,
! [X69,X70,X71,X72] :
( ~ r2(X69,X72)
| X72 != X71
| ~ r2(X70,X71)
| X69 = X70 ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_4])]) ).
fof(c_0_8,plain,
! [X46,X48] :
( ( r2(X46,X48)
| ~ r2(X46,X48) )
& ( X48 = esk2_1(X46)
| ~ r2(X46,X48) )
& ( r2(X46,X48)
| X48 != esk2_1(X46) )
& ( X48 = esk2_1(X46)
| X48 != esk2_1(X46) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_5])])]) ).
fof(c_0_9,negated_conjecture,
~ ? [X39] :
( ! [X22] :
( ! [X23] :
( ! [X16] :
( ~ r1(X16)
| ~ r2(X16,X23) )
| ~ r2(X23,X22) )
| X39 != X22 )
& ! [X17] :
( ~ r1(X17)
| X39 != X17 ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[nonzerononetwoexist])]) ).
fof(c_0_10,plain,
! [X84,X85,X86] :
( ~ r1(X86)
| X86 != X85
| ~ r2(X84,X85) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_6])]) ).
cnf(c_0_11,plain,
( X1 = X4
| ~ r2(X1,X2)
| X2 != X3
| ~ r2(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( r2(X1,X2)
| X2 != esk2_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_13,negated_conjecture,
! [X87] :
( ( r1(esk24_1(X87))
| r1(esk23_1(X87)) )
& ( X87 = esk24_1(X87)
| r1(esk23_1(X87)) )
& ( r1(esk24_1(X87))
| r2(esk23_1(X87),esk22_1(X87)) )
& ( X87 = esk24_1(X87)
| r2(esk23_1(X87),esk22_1(X87)) )
& ( r1(esk24_1(X87))
| r2(esk22_1(X87),esk21_1(X87)) )
& ( X87 = esk24_1(X87)
| r2(esk22_1(X87),esk21_1(X87)) )
& ( r1(esk24_1(X87))
| X87 = esk21_1(X87) )
& ( X87 = esk24_1(X87)
| X87 = esk21_1(X87) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])]) ).
cnf(c_0_14,plain,
( ~ r1(X1)
| X1 != X2
| ~ r2(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
( X1 = X2
| ~ r2(X2,X3)
| ~ r2(X1,X3) ),
inference(er,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
r2(X1,esk2_1(X1)),
inference(er,[status(thm)],[c_0_12]) ).
cnf(c_0_17,negated_conjecture,
( r1(esk24_1(X1))
| r2(esk22_1(X1),esk21_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,negated_conjecture,
( r1(esk24_1(X1))
| X1 = esk21_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,negated_conjecture,
( X1 = esk24_1(X1)
| r2(esk22_1(X1),esk21_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,negated_conjecture,
( X1 = esk24_1(X1)
| X1 = esk21_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,plain,
( ~ r2(X1,X2)
| ~ r1(X2) ),
inference(er,[status(thm)],[c_0_14]) ).
cnf(c_0_22,negated_conjecture,
( r1(esk24_1(X1))
| r2(esk23_1(X1),esk22_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_23,plain,
( X1 = X2
| ~ r2(X1,esk2_1(X2)) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_24,negated_conjecture,
( r2(esk22_1(X1),X1)
| r1(esk24_1(X1)) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_25,negated_conjecture,
( X1 = esk24_1(X1)
| r2(esk23_1(X1),esk22_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_26,negated_conjecture,
( esk24_1(X1) = X1
| r2(esk22_1(X1),X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_27,negated_conjecture,
( r1(esk24_1(X1))
| ~ r1(esk22_1(X1)) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_28,negated_conjecture,
( esk22_1(esk2_1(X1)) = X1
| r1(esk24_1(esk2_1(X1))) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_29,negated_conjecture,
( esk24_1(X1) = X1
| ~ r1(esk22_1(X1)) ),
inference(spm,[status(thm)],[c_0_21,c_0_25]) ).
cnf(c_0_30,negated_conjecture,
( esk24_1(esk2_1(X1)) = esk2_1(X1)
| esk22_1(esk2_1(X1)) = X1 ),
inference(spm,[status(thm)],[c_0_23,c_0_26]) ).
cnf(c_0_31,negated_conjecture,
( r1(esk24_1(esk2_1(X1)))
| ~ r1(X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,negated_conjecture,
( esk24_1(esk2_1(X1)) = esk2_1(X1)
| ~ r1(X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_33,plain,
~ r1(esk2_1(X1)),
inference(spm,[status(thm)],[c_0_21,c_0_16]) ).
cnf(c_0_34,negated_conjecture,
( r1(esk24_1(X1))
| r1(esk23_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_35,negated_conjecture,
~ r1(X1),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]) ).
cnf(c_0_36,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_34,c_0_35]),c_0_35]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : NUN066+2 : TPTP v8.1.2. Released v7.3.0.
% 0.13/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n026.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 2400
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon Oct 2 21:10:29 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.21/0.46 Running first-order model finding
% 0.21/0.46 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.qg1ZFnJT0Q/E---3.1_4986.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 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 5064 completed with status 0
% 0.21/0.50 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 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 # No SInE strategy applied
% 0.21/0.50 # Search class: FGHSM-FFMF21-SFFFFFNN
% 0.21/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4b with 811s (1) cores
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.21/0.50 # Starting new_bool_3 with 136s (1) cores
% 0.21/0.50 # Starting new_bool_1 with 136s (1) cores
% 0.21/0.50 # Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 0.21/0.50 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 5069 completed with status 0
% 0.21/0.50 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 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 # No SInE strategy applied
% 0.21/0.50 # Search class: FGHSM-FFMF21-SFFFFFNN
% 0.21/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4b with 811s (1) cores
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.21/0.50 # Preprocessing time : 0.002 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 : 47
% 0.21/0.50 # Removed in clause preprocessing : 12
% 0.21/0.50 # Initial clauses in saturation : 35
% 0.21/0.50 # Processed clauses : 306
% 0.21/0.50 # ...of these trivial : 0
% 0.21/0.50 # ...subsumed : 128
% 0.21/0.50 # ...remaining for further processing : 178
% 0.21/0.50 # Other redundant clauses eliminated : 6
% 0.21/0.50 # Clauses deleted for lack of memory : 0
% 0.21/0.50 # Backward-subsumed : 24
% 0.21/0.50 # Backward-rewritten : 20
% 0.21/0.50 # Generated clauses : 838
% 0.21/0.50 # ...of the previous two non-redundant : 751
% 0.21/0.50 # ...aggressively subsumed : 0
% 0.21/0.50 # Contextual simplify-reflections : 2
% 0.21/0.50 # Paramodulations : 806
% 0.21/0.50 # Factorizations : 2
% 0.21/0.50 # NegExts : 0
% 0.21/0.50 # Equation resolutions : 6
% 0.21/0.50 # Total rewrite steps : 122
% 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 : 69
% 0.21/0.50 # Positive orientable unit clauses : 25
% 0.21/0.50 # Positive unorientable unit clauses: 0
% 0.21/0.50 # Negative unit clauses : 1
% 0.21/0.50 # Non-unit-clauses : 43
% 0.21/0.50 # Current number of unprocessed clauses: 497
% 0.21/0.50 # ...number of literals in the above : 1462
% 0.21/0.50 # Current number of archived formulas : 0
% 0.21/0.50 # Current number of archived clauses : 107
% 0.21/0.50 # Clause-clause subsumption calls (NU) : 1466
% 0.21/0.50 # Rec. Clause-clause subsumption calls : 1302
% 0.21/0.50 # Non-unit clause-clause subsumptions : 122
% 0.21/0.50 # Unit Clause-clause subsumption calls : 129
% 0.21/0.50 # Rewrite failures with RHS unbound : 0
% 0.21/0.50 # BW rewrite match attempts : 29
% 0.21/0.50 # BW rewrite match successes : 18
% 0.21/0.50 # Condensation attempts : 0
% 0.21/0.50 # Condensation successes : 0
% 0.21/0.50 # Termbank termtop insertions : 9273
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.021 s
% 0.21/0.50 # System time : 0.003 s
% 0.21/0.50 # Total time : 0.024 s
% 0.21/0.50 # Maximum resident set size: 1828 pages
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.096 s
% 0.21/0.50 # System time : 0.009 s
% 0.21/0.50 # Total time : 0.104 s
% 0.21/0.50 # Maximum resident set size: 1720 pages
% 0.21/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------