TSTP Solution File: RNG114+4 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : RNG114+4 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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 : Tue May 21 02:36:26 EDT 2024
% Result : Theorem 0.36s 0.55s
% Output : CNFRefutation 0.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 25 ( 8 unt; 0 def)
% Number of atoms : 157 ( 48 equ)
% Maximal formula atoms : 33 ( 6 avg)
% Number of connectives : 187 ( 55 ~; 43 |; 77 &)
% ( 7 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 32 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 21 ( 21 usr; 10 con; 0-2 aty)
% Number of variables : 67 ( 0 sgn 34 !; 26 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__2273,hypothesis,
( ? [X1,X2] :
( aElementOf0(X1,slsdtgt0(xa))
& aElementOf0(X2,slsdtgt0(xb))
& sdtpldt0(X1,X2) = xu )
& aElementOf0(xu,xI)
& xu != sz00
& ! [X1] :
( ( ( ? [X2,X3] :
( aElementOf0(X2,slsdtgt0(xa))
& aElementOf0(X3,slsdtgt0(xb))
& sdtpldt0(X2,X3) = X1 )
| aElementOf0(X1,xI) )
& X1 != sz00 )
=> ~ iLess0(sbrdtbr0(X1),sbrdtbr0(xu)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2273) ).
fof(m__,conjecture,
? [X1,X2] :
( aElement0(X1)
& aElement0(X2)
& xu = sdtpldt0(sdtasdt0(xa,X1),sdtasdt0(xb,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(m__2174,hypothesis,
( aSet0(xI)
& ! [X1] :
( aElementOf0(X1,xI)
=> ( ! [X2] :
( aElementOf0(X2,xI)
=> aElementOf0(sdtpldt0(X1,X2),xI) )
& ! [X2] :
( aElement0(X2)
=> aElementOf0(sdtasdt0(X2,X1),xI) ) ) )
& aIdeal0(xI)
& ! [X1] :
( aElementOf0(X1,slsdtgt0(xa))
<=> ? [X2] :
( aElement0(X2)
& sdtasdt0(xa,X2) = X1 ) )
& ! [X1] :
( aElementOf0(X1,slsdtgt0(xb))
<=> ? [X2] :
( aElement0(X2)
& sdtasdt0(xb,X2) = X1 ) )
& ! [X1] :
( aElementOf0(X1,xI)
<=> ? [X2,X3] :
( aElementOf0(X2,slsdtgt0(xa))
& aElementOf0(X3,slsdtgt0(xb))
& sdtpldt0(X2,X3) = X1 ) )
& xI = sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2174) ).
fof(m__2228,hypothesis,
? [X1] :
( ! [X2] :
( aElementOf0(X2,slsdtgt0(xa))
<=> ? [X3] :
( aElement0(X3)
& sdtasdt0(xa,X3) = X2 ) )
& ! [X2] :
( aElementOf0(X2,slsdtgt0(xb))
<=> ? [X3] :
( aElement0(X3)
& sdtasdt0(xb,X3) = X2 ) )
& ? [X2,X3] :
( aElementOf0(X2,slsdtgt0(xa))
& aElementOf0(X3,slsdtgt0(xb))
& sdtpldt0(X2,X3) = X1 )
& aElementOf0(X1,sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)))
& X1 != sz00 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2228) ).
fof(c_0_4,hypothesis,
( ? [X1,X2] :
( aElementOf0(X1,slsdtgt0(xa))
& aElementOf0(X2,slsdtgt0(xb))
& sdtpldt0(X1,X2) = xu )
& aElementOf0(xu,xI)
& xu != sz00
& ! [X1] :
( ( ( ? [X2,X3] :
( aElementOf0(X2,slsdtgt0(xa))
& aElementOf0(X3,slsdtgt0(xb))
& sdtpldt0(X2,X3) = X1 )
| aElementOf0(X1,xI) )
& X1 != sz00 )
=> ~ iLess0(sbrdtbr0(X1),sbrdtbr0(xu)) ) ),
inference(fof_simplification,[status(thm)],[m__2273]) ).
fof(c_0_5,negated_conjecture,
~ ? [X1,X2] :
( aElement0(X1)
& aElement0(X2)
& xu = sdtpldt0(sdtasdt0(xa,X1),sdtasdt0(xb,X2)) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_6,hypothesis,
! [X13,X14,X15,X16,X18,X19,X20,X22,X23,X24,X27,X28,X29] :
( aSet0(xI)
& ( ~ aElementOf0(X14,xI)
| aElementOf0(sdtpldt0(X13,X14),xI)
| ~ aElementOf0(X13,xI) )
& ( ~ aElement0(X15)
| aElementOf0(sdtasdt0(X15,X13),xI)
| ~ aElementOf0(X13,xI) )
& aIdeal0(xI)
& ( aElement0(esk4_1(X16))
| ~ aElementOf0(X16,slsdtgt0(xa)) )
& ( sdtasdt0(xa,esk4_1(X16)) = X16
| ~ aElementOf0(X16,slsdtgt0(xa)) )
& ( ~ aElement0(X19)
| sdtasdt0(xa,X19) != X18
| aElementOf0(X18,slsdtgt0(xa)) )
& ( aElement0(esk5_1(X20))
| ~ aElementOf0(X20,slsdtgt0(xb)) )
& ( sdtasdt0(xb,esk5_1(X20)) = X20
| ~ aElementOf0(X20,slsdtgt0(xb)) )
& ( ~ aElement0(X23)
| sdtasdt0(xb,X23) != X22
| aElementOf0(X22,slsdtgt0(xb)) )
& ( aElementOf0(esk6_1(X24),slsdtgt0(xa))
| ~ aElementOf0(X24,xI) )
& ( aElementOf0(esk7_1(X24),slsdtgt0(xb))
| ~ aElementOf0(X24,xI) )
& ( sdtpldt0(esk6_1(X24),esk7_1(X24)) = X24
| ~ aElementOf0(X24,xI) )
& ( ~ aElementOf0(X28,slsdtgt0(xa))
| ~ aElementOf0(X29,slsdtgt0(xb))
| sdtpldt0(X28,X29) != X27
| aElementOf0(X27,xI) )
& xI = sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)) ),
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)],[m__2174])])])])])])]) ).
fof(c_0_7,hypothesis,
! [X45,X46,X47] :
( aElementOf0(esk17_0,slsdtgt0(xa))
& aElementOf0(esk18_0,slsdtgt0(xb))
& sdtpldt0(esk17_0,esk18_0) = xu
& aElementOf0(xu,xI)
& xu != sz00
& ( ~ aElementOf0(X46,slsdtgt0(xa))
| ~ aElementOf0(X47,slsdtgt0(xb))
| sdtpldt0(X46,X47) != X45
| X45 = sz00
| ~ iLess0(sbrdtbr0(X45),sbrdtbr0(xu)) )
& ( ~ aElementOf0(X45,xI)
| X45 = sz00
| ~ iLess0(sbrdtbr0(X45),sbrdtbr0(xu)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])])])]) ).
fof(c_0_8,hypothesis,
? [X1] :
( ! [X2] :
( aElementOf0(X2,slsdtgt0(xa))
<=> ? [X3] :
( aElement0(X3)
& sdtasdt0(xa,X3) = X2 ) )
& ! [X2] :
( aElementOf0(X2,slsdtgt0(xb))
<=> ? [X3] :
( aElement0(X3)
& sdtasdt0(xb,X3) = X2 ) )
& ? [X2,X3] :
( aElementOf0(X2,slsdtgt0(xa))
& aElementOf0(X3,slsdtgt0(xb))
& sdtpldt0(X2,X3) = X1 )
& aElementOf0(X1,sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)))
& X1 != sz00 ),
inference(fof_simplification,[status(thm)],[m__2228]) ).
fof(c_0_9,negated_conjecture,
! [X50,X51] :
( ~ aElement0(X50)
| ~ aElement0(X51)
| xu != sdtpldt0(sdtasdt0(xa,X50),sdtasdt0(xb,X51)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
cnf(c_0_10,hypothesis,
( sdtasdt0(xa,esk4_1(X1)) = X1
| ~ aElementOf0(X1,slsdtgt0(xa)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,hypothesis,
aElementOf0(esk17_0,slsdtgt0(xa)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,hypothesis,
( aElement0(esk4_1(X1))
| ~ aElementOf0(X1,slsdtgt0(xa)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_13,hypothesis,
! [X35,X37,X38,X40] :
( ( aElement0(esk13_1(X35))
| ~ aElementOf0(X35,slsdtgt0(xa)) )
& ( sdtasdt0(xa,esk13_1(X35)) = X35
| ~ aElementOf0(X35,slsdtgt0(xa)) )
& ( ~ aElement0(X37)
| sdtasdt0(xa,X37) != X35
| aElementOf0(X35,slsdtgt0(xa)) )
& ( aElement0(esk14_1(X38))
| ~ aElementOf0(X38,slsdtgt0(xb)) )
& ( sdtasdt0(xb,esk14_1(X38)) = X38
| ~ aElementOf0(X38,slsdtgt0(xb)) )
& ( ~ aElement0(X40)
| sdtasdt0(xb,X40) != X38
| aElementOf0(X38,slsdtgt0(xb)) )
& aElementOf0(esk15_0,slsdtgt0(xa))
& aElementOf0(esk16_0,slsdtgt0(xb))
& sdtpldt0(esk15_0,esk16_0) = esk12_0
& aElementOf0(esk12_0,sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)))
& esk12_0 != 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(fof_nnf,[status(thm)],[c_0_8])])])])])]) ).
cnf(c_0_14,negated_conjecture,
( ~ aElement0(X1)
| ~ aElement0(X2)
| xu != sdtpldt0(sdtasdt0(xa,X1),sdtasdt0(xb,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,hypothesis,
sdtasdt0(xa,esk4_1(esk17_0)) = esk17_0,
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,hypothesis,
aElement0(esk4_1(esk17_0)),
inference(spm,[status(thm)],[c_0_12,c_0_11]) ).
cnf(c_0_17,hypothesis,
( sdtasdt0(xb,esk14_1(X1)) = X1
| ~ aElementOf0(X1,slsdtgt0(xb)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,hypothesis,
aElementOf0(esk18_0,slsdtgt0(xb)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_19,hypothesis,
( aElement0(esk14_1(X1))
| ~ aElementOf0(X1,slsdtgt0(xb)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,negated_conjecture,
( sdtpldt0(esk17_0,sdtasdt0(xb,X1)) != xu
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]) ).
cnf(c_0_21,hypothesis,
sdtasdt0(xb,esk14_1(esk18_0)) = esk18_0,
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,hypothesis,
sdtpldt0(esk17_0,esk18_0) = xu,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_23,hypothesis,
aElement0(esk14_1(esk18_0)),
inference(spm,[status(thm)],[c_0_19,c_0_18]) ).
cnf(c_0_24,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : RNG114+4 : TPTP v8.2.0. Released v4.0.0.
% 0.08/0.15 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n002.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Sat May 18 12:15:53 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.22/0.49 Running first-order theorem proving
% 0.22/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/benchmark/theBenchmark.p
% 0.36/0.55 # Version: 3.1.0
% 0.36/0.55 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.36/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.36/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.36/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.36/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.36/0.55 # Starting sh5l with 300s (1) cores
% 0.36/0.55 # new_bool_3 with pid 8671 completed with status 0
% 0.36/0.55 # Result found by new_bool_3
% 0.36/0.55 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.36/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.36/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.36/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.36/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.36/0.55 # Search class: FGHSF-FSLM31-MFFFFFNN
% 0.36/0.55 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.36/0.55 # Starting G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with 163s (1) cores
% 0.36/0.55 # G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with pid 8674 completed with status 0
% 0.36/0.55 # Result found by G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S
% 0.36/0.55 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.36/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.36/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.36/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.36/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.36/0.55 # Search class: FGHSF-FSLM31-MFFFFFNN
% 0.36/0.55 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.36/0.55 # Starting G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with 163s (1) cores
% 0.36/0.55 # Preprocessing time : 0.002 s
% 0.36/0.55 # Presaturation interreduction done
% 0.36/0.55
% 0.36/0.55 # Proof found!
% 0.36/0.55 # SZS status Theorem
% 0.36/0.55 # SZS output start CNFRefutation
% See solution above
% 0.36/0.55 # Parsed axioms : 47
% 0.36/0.55 # Removed by relevancy pruning/SinE : 11
% 0.36/0.55 # Initial clauses : 162
% 0.36/0.55 # Removed in clause preprocessing : 4
% 0.36/0.55 # Initial clauses in saturation : 158
% 0.36/0.55 # Processed clauses : 750
% 0.36/0.55 # ...of these trivial : 25
% 0.36/0.55 # ...subsumed : 242
% 0.36/0.55 # ...remaining for further processing : 483
% 0.36/0.55 # Other redundant clauses eliminated : 6
% 0.36/0.55 # Clauses deleted for lack of memory : 0
% 0.36/0.55 # Backward-subsumed : 0
% 0.36/0.55 # Backward-rewritten : 5
% 0.36/0.55 # Generated clauses : 1902
% 0.36/0.55 # ...of the previous two non-redundant : 1793
% 0.36/0.55 # ...aggressively subsumed : 0
% 0.36/0.55 # Contextual simplify-reflections : 0
% 0.36/0.55 # Paramodulations : 1874
% 0.36/0.55 # Factorizations : 0
% 0.36/0.55 # NegExts : 0
% 0.36/0.55 # Equation resolutions : 25
% 0.36/0.55 # Disequality decompositions : 0
% 0.36/0.55 # Total rewrite steps : 2239
% 0.36/0.55 # ...of those cached : 2178
% 0.36/0.55 # Propositional unsat checks : 0
% 0.36/0.55 # Propositional check models : 0
% 0.36/0.55 # Propositional check unsatisfiable : 0
% 0.36/0.55 # Propositional clauses : 0
% 0.36/0.55 # Propositional clauses after purity: 0
% 0.36/0.55 # Propositional unsat core size : 0
% 0.36/0.55 # Propositional preprocessing time : 0.000
% 0.36/0.55 # Propositional encoding time : 0.000
% 0.36/0.55 # Propositional solver time : 0.000
% 0.36/0.55 # Success case prop preproc time : 0.000
% 0.36/0.55 # Success case prop encoding time : 0.000
% 0.36/0.55 # Success case prop solver time : 0.000
% 0.36/0.55 # Current number of processed clauses : 320
% 0.36/0.55 # Positive orientable unit clauses : 104
% 0.36/0.55 # Positive unorientable unit clauses: 0
% 0.36/0.55 # Negative unit clauses : 28
% 0.36/0.55 # Non-unit-clauses : 188
% 0.36/0.55 # Current number of unprocessed clauses: 1352
% 0.36/0.55 # ...number of literals in the above : 4688
% 0.36/0.55 # Current number of archived formulas : 0
% 0.36/0.55 # Current number of archived clauses : 162
% 0.36/0.55 # Clause-clause subsumption calls (NU) : 5728
% 0.36/0.55 # Rec. Clause-clause subsumption calls : 2694
% 0.36/0.55 # Non-unit clause-clause subsumptions : 132
% 0.36/0.55 # Unit Clause-clause subsumption calls : 1390
% 0.36/0.55 # Rewrite failures with RHS unbound : 0
% 0.36/0.55 # BW rewrite match attempts : 9
% 0.36/0.55 # BW rewrite match successes : 5
% 0.36/0.55 # Condensation attempts : 0
% 0.36/0.55 # Condensation successes : 0
% 0.36/0.55 # Termbank termtop insertions : 36840
% 0.36/0.55 # Search garbage collected termcells : 2303
% 0.36/0.55
% 0.36/0.55 # -------------------------------------------------
% 0.36/0.55 # User time : 0.040 s
% 0.36/0.55 # System time : 0.004 s
% 0.36/0.55 # Total time : 0.044 s
% 0.36/0.55 # Maximum resident set size: 2220 pages
% 0.36/0.55
% 0.36/0.55 # -------------------------------------------------
% 0.36/0.55 # User time : 0.042 s
% 0.36/0.55 # System time : 0.007 s
% 0.36/0.55 # Total time : 0.049 s
% 0.36/0.55 # Maximum resident set size: 1772 pages
% 0.36/0.55 % E---3.1 exiting
% 0.36/0.55 % E exiting
%------------------------------------------------------------------------------