TSTP Solution File: RNG112+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : RNG112+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n020.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 : 300s
% WCLimit : 300s
% DateTime : Sat May 4 09:14:39 EDT 2024
% Result : Theorem 0.37s 0.55s
% Output : CNFRefutation 0.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of formulae : 28 ( 8 unt; 0 def)
% Number of atoms : 89 ( 41 equ)
% Maximal formula atoms : 11 ( 3 avg)
% Number of connectives : 102 ( 41 ~; 33 |; 22 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 24 ( 0 sgn 9 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__2228,hypothesis,
? [X1] :
( aElementOf0(X1,sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)))
& X1 != sz00 ),
file('/export/starexec/sandbox2/tmp/tmp.SEtTPerHTA/E---3.1_10165.p',m__2228) ).
fof(m__2351,hypothesis,
! [X1] :
( ( aElementOf0(X1,xI)
& X1 != sz00 )
=> ? [X2] :
( aElementOf0(X2,xI)
& X2 != sz00
& ! [X3] :
( ( aElementOf0(X3,xI)
& X3 != sz00 )
=> ~ iLess0(sbrdtbr0(X3),sbrdtbr0(X2)) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.SEtTPerHTA/E---3.1_10165.p',m__2351) ).
fof(m__,conjecture,
? [X1] :
( aElementOf0(X1,xI)
& X1 != sz00
& ! [X2] :
( ( aElementOf0(X2,xI)
& X2 != sz00 )
=> ~ iLess0(sbrdtbr0(X2),sbrdtbr0(X1)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.SEtTPerHTA/E---3.1_10165.p',m__) ).
fof(m__2174,hypothesis,
( aIdeal0(xI)
& xI = sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)) ),
file('/export/starexec/sandbox2/tmp/tmp.SEtTPerHTA/E---3.1_10165.p',m__2174) ).
fof(c_0_4,hypothesis,
? [X1] :
( aElementOf0(X1,sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)))
& X1 != sz00 ),
inference(fof_simplification,[status(thm)],[m__2228]) ).
fof(c_0_5,hypothesis,
! [X1] :
( ( aElementOf0(X1,xI)
& X1 != sz00 )
=> ? [X2] :
( aElementOf0(X2,xI)
& X2 != sz00
& ! [X3] :
( ( aElementOf0(X3,xI)
& X3 != sz00 )
=> ~ iLess0(sbrdtbr0(X3),sbrdtbr0(X2)) ) ) ),
inference(fof_simplification,[status(thm)],[m__2351]) ).
fof(c_0_6,hypothesis,
( aElementOf0(esk1_0,sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)))
& esk1_0 != sz00 ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_4])])]) ).
fof(c_0_7,negated_conjecture,
~ ? [X1] :
( aElementOf0(X1,xI)
& X1 != sz00
& ! [X2] :
( ( aElementOf0(X2,xI)
& X2 != sz00 )
=> ~ iLess0(sbrdtbr0(X2),sbrdtbr0(X1)) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).
fof(c_0_8,hypothesis,
! [X8,X10] :
( ( aElementOf0(esk2_0,xI)
| ~ aElementOf0(X8,xI)
| X8 = sz00 )
& ( esk2_0 != sz00
| ~ aElementOf0(X8,xI)
| X8 = sz00 )
& ( ~ aElementOf0(X10,xI)
| X10 = sz00
| ~ iLess0(sbrdtbr0(X10),sbrdtbr0(esk2_0))
| ~ aElementOf0(X8,xI)
| X8 = sz00 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])])])]) ).
cnf(c_0_9,hypothesis,
aElementOf0(esk1_0,sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,hypothesis,
xI = sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)),
inference(split_conjunct,[status(thm)],[m__2174]) ).
fof(c_0_11,negated_conjecture,
! [X11] :
( ( aElementOf0(esk3_1(X11),xI)
| ~ aElementOf0(X11,xI)
| X11 = sz00 )
& ( esk3_1(X11) != sz00
| ~ aElementOf0(X11,xI)
| X11 = sz00 )
& ( iLess0(sbrdtbr0(esk3_1(X11)),sbrdtbr0(X11))
| ~ aElementOf0(X11,xI)
| X11 = sz00 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])])]) ).
cnf(c_0_12,hypothesis,
( aElementOf0(esk2_0,xI)
| X1 = sz00
| ~ aElementOf0(X1,xI) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,hypothesis,
aElementOf0(esk1_0,xI),
inference(rw,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,hypothesis,
esk1_0 != sz00,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_15,negated_conjecture,
( iLess0(sbrdtbr0(esk3_1(X1)),sbrdtbr0(X1))
| X1 = sz00
| ~ aElementOf0(X1,xI) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,hypothesis,
aElementOf0(esk2_0,xI),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
cnf(c_0_17,negated_conjecture,
( aElementOf0(esk3_1(X1),xI)
| X1 = sz00
| ~ aElementOf0(X1,xI) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,hypothesis,
( X1 = sz00
| X2 = sz00
| ~ aElementOf0(X1,xI)
| ~ iLess0(sbrdtbr0(X1),sbrdtbr0(esk2_0))
| ~ aElementOf0(X2,xI) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_19,hypothesis,
( esk2_0 = sz00
| iLess0(sbrdtbr0(esk3_1(esk2_0)),sbrdtbr0(esk2_0)) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,negated_conjecture,
( esk2_0 = sz00
| aElementOf0(esk3_1(esk2_0),xI) ),
inference(spm,[status(thm)],[c_0_17,c_0_16]) ).
cnf(c_0_21,hypothesis,
( X1 = sz00
| esk2_0 != sz00
| ~ aElementOf0(X1,xI) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_22,hypothesis,
( esk3_1(esk2_0) = sz00
| X1 = sz00
| ~ aElementOf0(X1,xI) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_21]) ).
cnf(c_0_23,negated_conjecture,
( X1 = sz00
| esk3_1(X1) != sz00
| ~ aElementOf0(X1,xI) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_24,hypothesis,
esk3_1(esk2_0) = sz00,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_13]),c_0_14]) ).
cnf(c_0_25,negated_conjecture,
esk2_0 = sz00,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_16])]) ).
cnf(c_0_26,hypothesis,
( X1 = sz00
| ~ aElementOf0(X1,xI) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_25])]) ).
cnf(c_0_27,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_13]),c_0_14]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : RNG112+1 : TPTP v8.1.2. Released v4.0.0.
% 0.03/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n020.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 : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri May 3 11:22:46 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.21/0.52 Running first-order theorem proving
% 0.21/0.52 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.SEtTPerHTA/E---3.1_10165.p
% 0.37/0.55 # Version: 3.1.0
% 0.37/0.55 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.37/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.37/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.37/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.37/0.55 # Starting sh5l with 300s (1) cores
% 0.37/0.55 # new_bool_1 with pid 10294 completed with status 0
% 0.37/0.55 # Result found by new_bool_1
% 0.37/0.55 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.37/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.37/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.37/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.37/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.37/0.55 # Search class: FGHSF-FFMM32-MFFFFFNN
% 0.37/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.37/0.55 # Starting G-E--_208_B07_F1_SE_CS_SP_PS_S4d with 181s (1) cores
% 0.37/0.55 # G-E--_208_B07_F1_SE_CS_SP_PS_S4d with pid 10296 completed with status 0
% 0.37/0.55 # Result found by G-E--_208_B07_F1_SE_CS_SP_PS_S4d
% 0.37/0.55 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.37/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.37/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.37/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.37/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.37/0.55 # Search class: FGHSF-FFMM32-MFFFFFNN
% 0.37/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.37/0.55 # Starting G-E--_208_B07_F1_SE_CS_SP_PS_S4d with 181s (1) cores
% 0.37/0.55 # Preprocessing time : 0.004 s
% 0.37/0.55 # Presaturation interreduction done
% 0.37/0.55
% 0.37/0.55 # Proof found!
% 0.37/0.55 # SZS status Theorem
% 0.37/0.55 # SZS output start CNFRefutation
% See solution above
% 0.37/0.55 # Parsed axioms : 46
% 0.37/0.55 # Removed by relevancy pruning/SinE : 11
% 0.37/0.55 # Initial clauses : 84
% 0.37/0.55 # Removed in clause preprocessing : 4
% 0.37/0.55 # Initial clauses in saturation : 80
% 0.37/0.55 # Processed clauses : 162
% 0.37/0.55 # ...of these trivial : 0
% 0.37/0.55 # ...subsumed : 0
% 0.37/0.55 # ...remaining for further processing : 162
% 0.37/0.55 # Other redundant clauses eliminated : 12
% 0.37/0.55 # Clauses deleted for lack of memory : 0
% 0.37/0.55 # Backward-subsumed : 4
% 0.37/0.55 # Backward-rewritten : 11
% 0.37/0.55 # Generated clauses : 84
% 0.37/0.55 # ...of the previous two non-redundant : 69
% 0.37/0.55 # ...aggressively subsumed : 0
% 0.37/0.55 # Contextual simplify-reflections : 3
% 0.37/0.55 # Paramodulations : 74
% 0.37/0.55 # Factorizations : 0
% 0.37/0.55 # NegExts : 0
% 0.37/0.55 # Equation resolutions : 12
% 0.37/0.55 # Disequality decompositions : 0
% 0.37/0.55 # Total rewrite steps : 71
% 0.37/0.55 # ...of those cached : 59
% 0.37/0.55 # Propositional unsat checks : 0
% 0.37/0.55 # Propositional check models : 0
% 0.37/0.55 # Propositional check unsatisfiable : 0
% 0.37/0.55 # Propositional clauses : 0
% 0.37/0.55 # Propositional clauses after purity: 0
% 0.37/0.55 # Propositional unsat core size : 0
% 0.37/0.55 # Propositional preprocessing time : 0.000
% 0.37/0.55 # Propositional encoding time : 0.000
% 0.37/0.55 # Propositional solver time : 0.000
% 0.37/0.55 # Success case prop preproc time : 0.000
% 0.37/0.55 # Success case prop encoding time : 0.000
% 0.37/0.55 # Success case prop solver time : 0.000
% 0.37/0.55 # Current number of processed clauses : 57
% 0.37/0.55 # Positive orientable unit clauses : 25
% 0.37/0.55 # Positive unorientable unit clauses: 0
% 0.37/0.55 # Negative unit clauses : 1
% 0.37/0.55 # Non-unit-clauses : 31
% 0.37/0.55 # Current number of unprocessed clauses: 62
% 0.37/0.55 # ...number of literals in the above : 239
% 0.37/0.55 # Current number of archived formulas : 0
% 0.37/0.55 # Current number of archived clauses : 95
% 0.37/0.55 # Clause-clause subsumption calls (NU) : 1187
% 0.37/0.55 # Rec. Clause-clause subsumption calls : 391
% 0.37/0.55 # Non-unit clause-clause subsumptions : 7
% 0.37/0.55 # Unit Clause-clause subsumption calls : 47
% 0.37/0.55 # Rewrite failures with RHS unbound : 0
% 0.37/0.55 # BW rewrite match attempts : 3
% 0.37/0.55 # BW rewrite match successes : 3
% 0.37/0.55 # Condensation attempts : 0
% 0.37/0.55 # Condensation successes : 0
% 0.37/0.55 # Termbank termtop insertions : 7947
% 0.37/0.55 # Search garbage collected termcells : 1633
% 0.37/0.55
% 0.37/0.55 # -------------------------------------------------
% 0.37/0.55 # User time : 0.015 s
% 0.37/0.55 # System time : 0.005 s
% 0.37/0.55 # Total time : 0.020 s
% 0.37/0.55 # Maximum resident set size: 2016 pages
% 0.37/0.55
% 0.37/0.55 # -------------------------------------------------
% 0.37/0.55 # User time : 0.017 s
% 0.37/0.55 # System time : 0.010 s
% 0.37/0.55 # Total time : 0.027 s
% 0.37/0.55 # Maximum resident set size: 1752 pages
% 0.37/0.55 % E---3.1 exiting
% 0.37/0.55 % E exiting
%------------------------------------------------------------------------------