TSTP Solution File: RNG072+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : RNG072+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n021.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:14:59 EDT 2023
% Result : Theorem 0.20s 0.56s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of formulae : 22 ( 11 unt; 0 def)
% Number of atoms : 54 ( 3 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 55 ( 23 ~; 19 |; 10 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 10 con; 0-2 aty)
% Number of variables : 18 ( 0 sgn; 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
sdtlseqdt0(sdtasdt0(sdtpldt0(xR,xS),sdtpldt0(xR,xS)),sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP))),
file('/export/starexec/sandbox2/tmp/tmp.QFwgqZxDoC/E---3.1_12470.p',m__) ).
fof(mLEMonM,axiom,
! [X1,X2,X3,X4] :
( ( aScalar0(X1)
& aScalar0(X2)
& aScalar0(X3)
& aScalar0(X4) )
=> ( ( sdtlseqdt0(X1,X2)
& sdtlseqdt0(sz0z00,X3)
& sdtlseqdt0(X3,X4) )
=> sdtlseqdt0(sdtasdt0(X1,X3),sdtasdt0(X2,X4)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.QFwgqZxDoC/E---3.1_12470.p',mLEMonM) ).
fof(m__2628,hypothesis,
( sdtlseqdt0(sz0z00,sdtpldt0(xR,xS))
& sdtlseqdt0(sz0z00,sdtpldt0(xP,xP)) ),
file('/export/starexec/sandbox2/tmp/tmp.QFwgqZxDoC/E---3.1_12470.p',m__2628) ).
fof(m__2610,hypothesis,
sdtlseqdt0(sdtpldt0(xR,xS),sdtpldt0(xP,xP)),
file('/export/starexec/sandbox2/tmp/tmp.QFwgqZxDoC/E---3.1_12470.p',m__2610) ).
fof(mSumSc,axiom,
! [X1,X2] :
( ( aScalar0(X1)
& aScalar0(X2) )
=> aScalar0(sdtpldt0(X1,X2)) ),
file('/export/starexec/sandbox2/tmp/tmp.QFwgqZxDoC/E---3.1_12470.p',mSumSc) ).
fof(m__1930,hypothesis,
( aScalar0(xS)
& xS = sdtasdt0(xF,xD) ),
file('/export/starexec/sandbox2/tmp/tmp.QFwgqZxDoC/E---3.1_12470.p',m__1930) ).
fof(m__1892,hypothesis,
( aScalar0(xR)
& xR = sdtasdt0(xC,xG) ),
file('/export/starexec/sandbox2/tmp/tmp.QFwgqZxDoC/E---3.1_12470.p',m__1892) ).
fof(m__1911,hypothesis,
( aScalar0(xP)
& xP = sdtasdt0(xE,xH) ),
file('/export/starexec/sandbox2/tmp/tmp.QFwgqZxDoC/E---3.1_12470.p',m__1911) ).
fof(c_0_8,negated_conjecture,
~ sdtlseqdt0(sdtasdt0(sdtpldt0(xR,xS),sdtpldt0(xR,xS)),sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP))),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).
fof(c_0_9,plain,
! [X51,X52,X53,X54] :
( ~ aScalar0(X51)
| ~ aScalar0(X52)
| ~ aScalar0(X53)
| ~ aScalar0(X54)
| ~ sdtlseqdt0(X51,X52)
| ~ sdtlseqdt0(sz0z00,X53)
| ~ sdtlseqdt0(X53,X54)
| sdtlseqdt0(sdtasdt0(X51,X53),sdtasdt0(X52,X54)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mLEMonM])]) ).
cnf(c_0_10,negated_conjecture,
~ sdtlseqdt0(sdtasdt0(sdtpldt0(xR,xS),sdtpldt0(xR,xS)),sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP))),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,plain,
( sdtlseqdt0(sdtasdt0(X1,X3),sdtasdt0(X2,X4))
| ~ aScalar0(X1)
| ~ aScalar0(X2)
| ~ aScalar0(X3)
| ~ aScalar0(X4)
| ~ sdtlseqdt0(X1,X2)
| ~ sdtlseqdt0(sz0z00,X3)
| ~ sdtlseqdt0(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,hypothesis,
sdtlseqdt0(sz0z00,sdtpldt0(xR,xS)),
inference(split_conjunct,[status(thm)],[m__2628]) ).
cnf(c_0_13,hypothesis,
sdtlseqdt0(sdtpldt0(xR,xS),sdtpldt0(xP,xP)),
inference(split_conjunct,[status(thm)],[m__2610]) ).
fof(c_0_14,plain,
! [X39,X40] :
( ~ aScalar0(X39)
| ~ aScalar0(X40)
| aScalar0(sdtpldt0(X39,X40)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSumSc])]) ).
cnf(c_0_15,negated_conjecture,
( ~ aScalar0(sdtpldt0(xP,xP))
| ~ aScalar0(sdtpldt0(xR,xS)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]),c_0_13])]) ).
cnf(c_0_16,plain,
( aScalar0(sdtpldt0(X1,X2))
| ~ aScalar0(X1)
| ~ aScalar0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_17,hypothesis,
aScalar0(xS),
inference(split_conjunct,[status(thm)],[m__1930]) ).
cnf(c_0_18,hypothesis,
aScalar0(xR),
inference(split_conjunct,[status(thm)],[m__1892]) ).
cnf(c_0_19,negated_conjecture,
~ aScalar0(sdtpldt0(xP,xP)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),c_0_18])]) ).
cnf(c_0_20,hypothesis,
aScalar0(xP),
inference(split_conjunct,[status(thm)],[m__1911]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_16]),c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : RNG072+1 : TPTP v8.1.2. Released v4.0.0.
% 0.11/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n021.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 : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Oct 2 19:46:59 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.52 Running first-order theorem proving
% 0.20/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.QFwgqZxDoC/E---3.1_12470.p
% 0.20/0.56 # Version: 3.1pre001
% 0.20/0.56 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.56 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.56 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.56 # Starting sh5l with 300s (1) cores
% 0.20/0.56 # new_bool_3 with pid 12592 completed with status 0
% 0.20/0.56 # Result found by new_bool_3
% 0.20/0.56 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.56 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.56 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.56 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.20/0.56 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.56 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.20/0.56 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 12600 completed with status 0
% 0.20/0.56 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.56 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.56 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.56 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.56 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.20/0.56 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.56 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.20/0.56 # Preprocessing time : 0.003 s
% 0.20/0.56 # Presaturation interreduction done
% 0.20/0.56
% 0.20/0.56 # Proof found!
% 0.20/0.56 # SZS status Theorem
% 0.20/0.56 # SZS output start CNFRefutation
% See solution above
% 0.20/0.56 # Parsed axioms : 63
% 0.20/0.56 # Removed by relevancy pruning/SinE : 4
% 0.20/0.56 # Initial clauses : 86
% 0.20/0.56 # Removed in clause preprocessing : 5
% 0.20/0.56 # Initial clauses in saturation : 81
% 0.20/0.56 # Processed clauses : 190
% 0.20/0.56 # ...of these trivial : 0
% 0.20/0.56 # ...subsumed : 1
% 0.20/0.56 # ...remaining for further processing : 189
% 0.20/0.56 # Other redundant clauses eliminated : 3
% 0.20/0.56 # Clauses deleted for lack of memory : 0
% 0.20/0.56 # Backward-subsumed : 2
% 0.20/0.56 # Backward-rewritten : 0
% 0.20/0.56 # Generated clauses : 309
% 0.20/0.56 # ...of the previous two non-redundant : 287
% 0.20/0.56 # ...aggressively subsumed : 0
% 0.20/0.56 # Contextual simplify-reflections : 0
% 0.20/0.56 # Paramodulations : 305
% 0.20/0.56 # Factorizations : 0
% 0.20/0.56 # NegExts : 0
% 0.20/0.56 # Equation resolutions : 4
% 0.20/0.56 # Total rewrite steps : 302
% 0.20/0.56 # Propositional unsat checks : 0
% 0.20/0.56 # Propositional check models : 0
% 0.20/0.56 # Propositional check unsatisfiable : 0
% 0.20/0.56 # Propositional clauses : 0
% 0.20/0.56 # Propositional clauses after purity: 0
% 0.20/0.56 # Propositional unsat core size : 0
% 0.20/0.56 # Propositional preprocessing time : 0.000
% 0.20/0.56 # Propositional encoding time : 0.000
% 0.20/0.56 # Propositional solver time : 0.000
% 0.20/0.56 # Success case prop preproc time : 0.000
% 0.20/0.56 # Success case prop encoding time : 0.000
% 0.20/0.56 # Success case prop solver time : 0.000
% 0.20/0.56 # Current number of processed clauses : 103
% 0.20/0.56 # Positive orientable unit clauses : 50
% 0.20/0.56 # Positive unorientable unit clauses: 0
% 0.20/0.56 # Negative unit clauses : 4
% 0.20/0.56 # Non-unit-clauses : 49
% 0.20/0.56 # Current number of unprocessed clauses: 259
% 0.20/0.56 # ...number of literals in the above : 1097
% 0.20/0.56 # Current number of archived formulas : 0
% 0.20/0.56 # Current number of archived clauses : 83
% 0.20/0.56 # Clause-clause subsumption calls (NU) : 1910
% 0.20/0.56 # Rec. Clause-clause subsumption calls : 467
% 0.20/0.56 # Non-unit clause-clause subsumptions : 0
% 0.20/0.56 # Unit Clause-clause subsumption calls : 25
% 0.20/0.56 # Rewrite failures with RHS unbound : 0
% 0.20/0.56 # BW rewrite match attempts : 2
% 0.20/0.56 # BW rewrite match successes : 0
% 0.20/0.56 # Condensation attempts : 0
% 0.20/0.56 # Condensation successes : 0
% 0.20/0.56 # Termbank termtop insertions : 10825
% 0.20/0.56
% 0.20/0.56 # -------------------------------------------------
% 0.20/0.56 # User time : 0.018 s
% 0.20/0.56 # System time : 0.006 s
% 0.20/0.56 # Total time : 0.024 s
% 0.20/0.56 # Maximum resident set size: 2020 pages
% 0.20/0.56
% 0.20/0.56 # -------------------------------------------------
% 0.20/0.56 # User time : 0.021 s
% 0.20/0.56 # System time : 0.008 s
% 0.20/0.56 # Total time : 0.028 s
% 0.20/0.56 # Maximum resident set size: 1748 pages
% 0.20/0.56 % E---3.1 exiting
% 0.20/0.56 % E---3.1 exiting
%------------------------------------------------------------------------------