TSTP Solution File: NUN070+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : NUN070+1 : TPTP v8.1.2. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n012.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:25 EDT 2023
% Result : Theorem 0.20s 0.50s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 22 ( 9 unt; 0 def)
% Number of atoms : 73 ( 0 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 88 ( 37 ~; 28 |; 23 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 0 con; 1-1 aty)
% Number of variables : 55 ( 2 sgn; 16 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
fof(onepluszeroidone,conjecture,
? [X63] :
( ? [X46] :
( ? [X40] :
( r1(X40)
& r3(X46,X40,X63) )
& ? [X41] :
( r1(X41)
& r2(X41,X46) ) )
& ? [X47] :
( id(X63,X47)
& ? [X49] :
( r1(X49)
& r2(X49,X47) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.pbDwnzqJcz/E---3.1_24441.p',onepluszeroidone) ).
fof(axiom_4a,axiom,
! [X54] :
? [X55] :
( id(X55,X54)
& ? [X56] :
( r1(X56)
& r3(X54,X56,X55) ) ),
file('/export/starexec/sandbox/tmp/tmp.pbDwnzqJcz/E---3.1_24441.p',axiom_4a) ).
fof(axiom_2,axiom,
! [X3] :
? [X4] :
! [X5] :
( ( id(X5,X4)
& r2(X3,X5) )
| ( ~ r2(X3,X5)
& ~ id(X5,X4) ) ),
file('/export/starexec/sandbox/tmp/tmp.pbDwnzqJcz/E---3.1_24441.p',axiom_2) ).
fof(axiom_5,axiom,
! [X14] : id(X14,X14),
file('/export/starexec/sandbox/tmp/tmp.pbDwnzqJcz/E---3.1_24441.p',axiom_5) ).
fof(c_0_4,negated_conjecture,
~ ? [X63] :
( ? [X46] :
( ? [X40] :
( r1(X40)
& r3(X46,X40,X63) )
& ? [X41] :
( r1(X41)
& r2(X41,X46) ) )
& ? [X47] :
( id(X63,X47)
& ? [X49] :
( r1(X49)
& r2(X49,X47) ) ) ),
inference(assume_negation,[status(cth)],[onepluszeroidone]) ).
fof(c_0_5,negated_conjecture,
! [X68,X69,X70,X71,X72,X73] :
( ~ r1(X70)
| ~ r3(X69,X70,X68)
| ~ r1(X71)
| ~ r2(X71,X69)
| ~ id(X68,X72)
| ~ r1(X73)
| ~ r2(X73,X72) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
fof(c_0_6,plain,
! [X108] :
( id(esk14_1(X108),X108)
& r1(esk15_1(X108))
& r3(X108,esk15_1(X108),esk14_1(X108)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[axiom_4a])]) ).
fof(c_0_7,plain,
! [X3] :
? [X4] :
! [X5] :
( ( id(X5,X4)
& r2(X3,X5) )
| ( ~ r2(X3,X5)
& ~ id(X5,X4) ) ),
inference(fof_simplification,[status(thm)],[axiom_2]) ).
cnf(c_0_8,negated_conjecture,
( ~ r1(X1)
| ~ r3(X2,X1,X3)
| ~ r1(X4)
| ~ r2(X4,X2)
| ~ id(X3,X5)
| ~ r1(X6)
| ~ r2(X6,X5) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
r3(X1,esk15_1(X1),esk14_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
r1(esk15_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_11,plain,
! [X74,X76] :
( ( ~ r2(X74,X76)
| id(X76,esk1_1(X74)) )
& ( ~ id(X76,esk1_1(X74))
| id(X76,esk1_1(X74)) )
& ( ~ r2(X74,X76)
| r2(X74,X76) )
& ( ~ id(X76,esk1_1(X74))
| r2(X74,X76) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_7])])]) ).
fof(c_0_12,plain,
! [X123] : id(X123,X123),
inference(variable_rename,[status(thm)],[axiom_5]) ).
cnf(c_0_13,negated_conjecture,
( ~ r2(X1,X2)
| ~ r2(X3,X4)
| ~ r1(X1)
| ~ r1(X3)
| ~ id(esk14_1(X4),X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10])]) ).
cnf(c_0_14,plain,
id(esk14_1(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_15,plain,
( r2(X2,X1)
| ~ id(X1,esk1_1(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
id(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,negated_conjecture,
( ~ r2(X1,X2)
| ~ r2(X3,X2)
| ~ r1(X1)
| ~ r1(X3) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,plain,
r2(X1,esk1_1(X1)),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,negated_conjecture,
( ~ r2(X1,esk1_1(X2))
| ~ r1(X2)
| ~ r1(X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_20,negated_conjecture,
~ r1(X1),
inference(spm,[status(thm)],[c_0_19,c_0_18]) ).
cnf(c_0_21,plain,
$false,
inference(sr,[status(thm)],[c_0_10,c_0_20]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : NUN070+1 : TPTP v8.1.2. Released v7.3.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n012.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 : 2400
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Oct 2 20:46:20 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order model finding
% 0.20/0.48 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.pbDwnzqJcz/E---3.1_24441.p
% 0.20/0.50 # Version: 3.1pre001
% 0.20/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.50 # Starting sh5l with 300s (1) cores
% 0.20/0.50 # sh5l with pid 24522 completed with status 0
% 0.20/0.50 # Result found by sh5l
% 0.20/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.50 # Starting sh5l with 300s (1) cores
% 0.20/0.50 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.50 # Search class: FGHNM-FFMF21-SFFFFFNN
% 0.20/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting H----_102_C18_F1_PI_AE_Q4_CS_SP_S1S with 139s (1) cores
% 0.20/0.50 # H----_102_C18_F1_PI_AE_Q4_CS_SP_S1S with pid 24527 completed with status 0
% 0.20/0.50 # Result found by H----_102_C18_F1_PI_AE_Q4_CS_SP_S1S
% 0.20/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.50 # Starting sh5l with 300s (1) cores
% 0.20/0.50 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.50 # Search class: FGHNM-FFMF21-SFFFFFNN
% 0.20/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting H----_102_C18_F1_PI_AE_Q4_CS_SP_S1S with 139s (1) cores
% 0.20/0.50 # Preprocessing time : 0.002 s
% 0.20/0.50
% 0.20/0.50 # Proof found!
% 0.20/0.50 # SZS status Theorem
% 0.20/0.50 # SZS output start CNFRefutation
% See solution above
% 0.20/0.50 # Parsed axioms : 19
% 0.20/0.50 # Removed by relevancy pruning/SinE : 0
% 0.20/0.50 # Initial clauses : 59
% 0.20/0.50 # Removed in clause preprocessing : 16
% 0.20/0.50 # Initial clauses in saturation : 43
% 0.20/0.50 # Processed clauses : 84
% 0.20/0.50 # ...of these trivial : 0
% 0.20/0.50 # ...subsumed : 2
% 0.20/0.50 # ...remaining for further processing : 82
% 0.20/0.50 # Other redundant clauses eliminated : 0
% 0.20/0.50 # Clauses deleted for lack of memory : 0
% 0.20/0.50 # Backward-subsumed : 25
% 0.20/0.50 # Backward-rewritten : 0
% 0.20/0.50 # Generated clauses : 220
% 0.20/0.50 # ...of the previous two non-redundant : 187
% 0.20/0.50 # ...aggressively subsumed : 0
% 0.20/0.50 # Contextual simplify-reflections : 0
% 0.20/0.50 # Paramodulations : 212
% 0.20/0.50 # Factorizations : 0
% 0.20/0.50 # NegExts : 0
% 0.20/0.50 # Equation resolutions : 0
% 0.20/0.50 # Total rewrite steps : 30
% 0.20/0.50 # Propositional unsat checks : 0
% 0.20/0.50 # Propositional check models : 0
% 0.20/0.50 # Propositional check unsatisfiable : 0
% 0.20/0.50 # Propositional clauses : 0
% 0.20/0.50 # Propositional clauses after purity: 0
% 0.20/0.50 # Propositional unsat core size : 0
% 0.20/0.50 # Propositional preprocessing time : 0.000
% 0.20/0.50 # Propositional encoding time : 0.000
% 0.20/0.50 # Propositional solver time : 0.000
% 0.20/0.50 # Success case prop preproc time : 0.000
% 0.20/0.50 # Success case prop encoding time : 0.000
% 0.20/0.50 # Success case prop solver time : 0.000
% 0.20/0.50 # Current number of processed clauses : 49
% 0.20/0.50 # Positive orientable unit clauses : 21
% 0.20/0.50 # Positive unorientable unit clauses: 0
% 0.20/0.50 # Negative unit clauses : 1
% 0.20/0.50 # Non-unit-clauses : 27
% 0.20/0.50 # Current number of unprocessed clauses: 144
% 0.20/0.50 # ...number of literals in the above : 344
% 0.20/0.50 # Current number of archived formulas : 0
% 0.20/0.50 # Current number of archived clauses : 33
% 0.20/0.50 # Clause-clause subsumption calls (NU) : 227
% 0.20/0.50 # Rec. Clause-clause subsumption calls : 128
% 0.20/0.50 # Non-unit clause-clause subsumptions : 0
% 0.20/0.50 # Unit Clause-clause subsumption calls : 125
% 0.20/0.50 # Rewrite failures with RHS unbound : 0
% 0.20/0.50 # BW rewrite match attempts : 5
% 0.20/0.50 # BW rewrite match successes : 0
% 0.20/0.50 # Condensation attempts : 0
% 0.20/0.50 # Condensation successes : 0
% 0.20/0.50 # Termbank termtop insertions : 4523
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.010 s
% 0.20/0.50 # System time : 0.003 s
% 0.20/0.50 # Total time : 0.013 s
% 0.20/0.50 # Maximum resident set size: 1912 pages
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.011 s
% 0.20/0.50 # System time : 0.005 s
% 0.20/0.50 # Total time : 0.017 s
% 0.20/0.50 # Maximum resident set size: 1748 pages
% 0.20/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------