TSTP Solution File: RNG073+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : RNG073+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.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:15:37 EDT 2023
% Result : Theorem 1.47s 0.64s
% Output : CNFRefutation 1.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of formulae : 35 ( 14 unt; 0 def)
% Number of atoms : 89 ( 19 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 96 ( 42 ~; 37 |; 11 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 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 : 25 ( 0 sgn; 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mLEASm,axiom,
! [X1,X2] :
( ( aScalar0(X1)
& aScalar0(X2) )
=> ( ( sdtlseqdt0(X1,X2)
& sdtlseqdt0(X2,X1) )
=> X1 = X2 ) ),
file('/export/starexec/sandbox/tmp/tmp.LRqWRuLsyu/E---3.1_28168.p',mLEASm) ).
fof(mSqrt,axiom,
! [X1,X2] :
( ( aScalar0(X1)
& aScalar0(X2) )
=> ( ( sdtlseqdt0(sz0z00,X1)
& sdtlseqdt0(sz0z00,X2)
& sdtasdt0(X1,X1) = sdtasdt0(X2,X2) )
=> X1 = X2 ) ),
file('/export/starexec/sandbox/tmp/tmp.LRqWRuLsyu/E---3.1_28168.p',mSqrt) ).
fof(m__2405,hypothesis,
sdtlseqdt0(sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP)),sdtasdt0(sdtpldt0(xR,xS),sdtpldt0(xR,xS))),
file('/export/starexec/sandbox/tmp/tmp.LRqWRuLsyu/E---3.1_28168.p',m__2405) ).
fof(m__2654,hypothesis,
sdtlseqdt0(sdtasdt0(sdtpldt0(xR,xS),sdtpldt0(xR,xS)),sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP))),
file('/export/starexec/sandbox/tmp/tmp.LRqWRuLsyu/E---3.1_28168.p',m__2654) ).
fof(mMulSc,axiom,
! [X1,X2] :
( ( aScalar0(X1)
& aScalar0(X2) )
=> aScalar0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox/tmp/tmp.LRqWRuLsyu/E---3.1_28168.p',mMulSc) ).
fof(m__2628,hypothesis,
( sdtlseqdt0(sz0z00,sdtpldt0(xR,xS))
& sdtlseqdt0(sz0z00,sdtpldt0(xP,xP)) ),
file('/export/starexec/sandbox/tmp/tmp.LRqWRuLsyu/E---3.1_28168.p',m__2628) ).
fof(m__,conjecture,
sdtpldt0(xR,xS) = sdtpldt0(xP,xP),
file('/export/starexec/sandbox/tmp/tmp.LRqWRuLsyu/E---3.1_28168.p',m__) ).
fof(mSumSc,axiom,
! [X1,X2] :
( ( aScalar0(X1)
& aScalar0(X2) )
=> aScalar0(sdtpldt0(X1,X2)) ),
file('/export/starexec/sandbox/tmp/tmp.LRqWRuLsyu/E---3.1_28168.p',mSumSc) ).
fof(m__1930,hypothesis,
( aScalar0(xS)
& xS = sdtasdt0(xF,xD) ),
file('/export/starexec/sandbox/tmp/tmp.LRqWRuLsyu/E---3.1_28168.p',m__1930) ).
fof(m__1892,hypothesis,
( aScalar0(xR)
& xR = sdtasdt0(xC,xG) ),
file('/export/starexec/sandbox/tmp/tmp.LRqWRuLsyu/E---3.1_28168.p',m__1892) ).
fof(m__1911,hypothesis,
( aScalar0(xP)
& xP = sdtasdt0(xE,xH) ),
file('/export/starexec/sandbox/tmp/tmp.LRqWRuLsyu/E---3.1_28168.p',m__1911) ).
fof(c_0_11,plain,
! [X32,X33] :
( ~ aScalar0(X32)
| ~ aScalar0(X33)
| ~ sdtlseqdt0(X32,X33)
| ~ sdtlseqdt0(X33,X32)
| X32 = X33 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mLEASm])]) ).
fof(c_0_12,plain,
! [X50,X51] :
( ~ aScalar0(X50)
| ~ aScalar0(X51)
| ~ sdtlseqdt0(sz0z00,X50)
| ~ sdtlseqdt0(sz0z00,X51)
| sdtasdt0(X50,X50) != sdtasdt0(X51,X51)
| X50 = X51 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSqrt])]) ).
cnf(c_0_13,plain,
( X1 = X2
| ~ aScalar0(X1)
| ~ aScalar0(X2)
| ~ sdtlseqdt0(X1,X2)
| ~ sdtlseqdt0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_14,hypothesis,
sdtlseqdt0(sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP)),sdtasdt0(sdtpldt0(xR,xS),sdtpldt0(xR,xS))),
inference(split_conjunct,[status(thm)],[m__2405]) ).
cnf(c_0_15,hypothesis,
sdtlseqdt0(sdtasdt0(sdtpldt0(xR,xS),sdtpldt0(xR,xS)),sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP))),
inference(split_conjunct,[status(thm)],[m__2654]) ).
fof(c_0_16,plain,
! [X13,X14] :
( ~ aScalar0(X13)
| ~ aScalar0(X14)
| aScalar0(sdtasdt0(X13,X14)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulSc])]) ).
cnf(c_0_17,plain,
( X1 = X2
| ~ aScalar0(X1)
| ~ aScalar0(X2)
| ~ sdtlseqdt0(sz0z00,X1)
| ~ sdtlseqdt0(sz0z00,X2)
| sdtasdt0(X1,X1) != sdtasdt0(X2,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,hypothesis,
sdtlseqdt0(sz0z00,sdtpldt0(xP,xP)),
inference(split_conjunct,[status(thm)],[m__2628]) ).
cnf(c_0_19,hypothesis,
( sdtasdt0(sdtpldt0(xR,xS),sdtpldt0(xR,xS)) = sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP))
| ~ aScalar0(sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP)))
| ~ aScalar0(sdtasdt0(sdtpldt0(xR,xS),sdtpldt0(xR,xS))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]) ).
cnf(c_0_20,plain,
( aScalar0(sdtasdt0(X1,X2))
| ~ aScalar0(X1)
| ~ aScalar0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_21,negated_conjecture,
sdtpldt0(xR,xS) != sdtpldt0(xP,xP),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).
cnf(c_0_22,hypothesis,
( X1 = sdtpldt0(xP,xP)
| sdtasdt0(X1,X1) != sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP))
| ~ sdtlseqdt0(sz0z00,X1)
| ~ aScalar0(sdtpldt0(xP,xP))
| ~ aScalar0(X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,hypothesis,
( sdtasdt0(sdtpldt0(xR,xS),sdtpldt0(xR,xS)) = sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP))
| ~ aScalar0(sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP)))
| ~ aScalar0(sdtpldt0(xR,xS)) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,hypothesis,
sdtlseqdt0(sz0z00,sdtpldt0(xR,xS)),
inference(split_conjunct,[status(thm)],[m__2628]) ).
cnf(c_0_25,negated_conjecture,
sdtpldt0(xR,xS) != sdtpldt0(xP,xP),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_26,hypothesis,
( ~ aScalar0(sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP)))
| ~ aScalar0(sdtpldt0(xP,xP))
| ~ aScalar0(sdtpldt0(xR,xS)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]),c_0_25]) ).
fof(c_0_27,plain,
! [X11,X12] :
( ~ aScalar0(X11)
| ~ aScalar0(X12)
| aScalar0(sdtpldt0(X11,X12)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSumSc])]) ).
cnf(c_0_28,hypothesis,
( ~ aScalar0(sdtpldt0(xP,xP))
| ~ aScalar0(sdtpldt0(xR,xS)) ),
inference(spm,[status(thm)],[c_0_26,c_0_20]) ).
cnf(c_0_29,plain,
( aScalar0(sdtpldt0(X1,X2))
| ~ aScalar0(X1)
| ~ aScalar0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_30,hypothesis,
aScalar0(xS),
inference(split_conjunct,[status(thm)],[m__1930]) ).
cnf(c_0_31,hypothesis,
aScalar0(xR),
inference(split_conjunct,[status(thm)],[m__1892]) ).
cnf(c_0_32,hypothesis,
~ aScalar0(sdtpldt0(xP,xP)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]),c_0_31])]) ).
cnf(c_0_33,hypothesis,
aScalar0(xP),
inference(split_conjunct,[status(thm)],[m__1911]) ).
cnf(c_0_34,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_29]),c_0_33])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : RNG073+1 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n011.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:44:53 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.22/0.49 Running first-order model finding
% 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 --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.LRqWRuLsyu/E---3.1_28168.p
% 1.47/0.64 # Version: 3.1pre001
% 1.47/0.64 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1.47/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.47/0.64 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.47/0.64 # Starting new_bool_3 with 300s (1) cores
% 1.47/0.64 # Starting new_bool_1 with 300s (1) cores
% 1.47/0.64 # Starting sh5l with 300s (1) cores
% 1.47/0.64 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 28253 completed with status 0
% 1.47/0.64 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 1.47/0.64 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1.47/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.47/0.64 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.47/0.64 # No SInE strategy applied
% 1.47/0.64 # Search class: FGHSF-FFMM21-MFFFFFNN
% 1.47/0.64 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.47/0.64 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 1.47/0.64 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1.47/0.64 # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 136s (1) cores
% 1.47/0.64 # Starting new_bool_3 with 136s (1) cores
% 1.47/0.64 # Starting new_bool_1 with 136s (1) cores
% 1.47/0.64 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 28263 completed with status 0
% 1.47/0.64 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 1.47/0.64 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1.47/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.47/0.64 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.47/0.64 # No SInE strategy applied
% 1.47/0.64 # Search class: FGHSF-FFMM21-MFFFFFNN
% 1.47/0.64 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.47/0.64 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 1.47/0.64 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1.47/0.64 # Preprocessing time : 0.003 s
% 1.47/0.64 # Presaturation interreduction done
% 1.47/0.64
% 1.47/0.64 # Proof found!
% 1.47/0.64 # SZS status Theorem
% 1.47/0.64 # SZS output start CNFRefutation
% See solution above
% 1.47/0.64 # Parsed axioms : 64
% 1.47/0.64 # Removed by relevancy pruning/SinE : 0
% 1.47/0.64 # Initial clauses : 99
% 1.47/0.64 # Removed in clause preprocessing : 5
% 1.47/0.64 # Initial clauses in saturation : 94
% 1.47/0.64 # Processed clauses : 1252
% 1.47/0.64 # ...of these trivial : 73
% 1.47/0.64 # ...subsumed : 477
% 1.47/0.64 # ...remaining for further processing : 702
% 1.47/0.64 # Other redundant clauses eliminated : 5
% 1.47/0.64 # Clauses deleted for lack of memory : 0
% 1.47/0.64 # Backward-subsumed : 27
% 1.47/0.64 # Backward-rewritten : 20
% 1.47/0.64 # Generated clauses : 7005
% 1.47/0.64 # ...of the previous two non-redundant : 5753
% 1.47/0.64 # ...aggressively subsumed : 0
% 1.47/0.64 # Contextual simplify-reflections : 34
% 1.47/0.64 # Paramodulations : 6991
% 1.47/0.64 # Factorizations : 0
% 1.47/0.64 # NegExts : 0
% 1.47/0.64 # Equation resolutions : 14
% 1.47/0.64 # Total rewrite steps : 9804
% 1.47/0.64 # Propositional unsat checks : 0
% 1.47/0.64 # Propositional check models : 0
% 1.47/0.64 # Propositional check unsatisfiable : 0
% 1.47/0.64 # Propositional clauses : 0
% 1.47/0.64 # Propositional clauses after purity: 0
% 1.47/0.64 # Propositional unsat core size : 0
% 1.47/0.64 # Propositional preprocessing time : 0.000
% 1.47/0.64 # Propositional encoding time : 0.000
% 1.47/0.64 # Propositional solver time : 0.000
% 1.47/0.64 # Success case prop preproc time : 0.000
% 1.47/0.64 # Success case prop encoding time : 0.000
% 1.47/0.64 # Success case prop solver time : 0.000
% 1.47/0.64 # Current number of processed clauses : 558
% 1.47/0.64 # Positive orientable unit clauses : 172
% 1.47/0.64 # Positive unorientable unit clauses: 0
% 1.47/0.64 # Negative unit clauses : 5
% 1.47/0.64 # Non-unit-clauses : 381
% 1.47/0.64 # Current number of unprocessed clauses: 4598
% 1.47/0.64 # ...number of literals in the above : 18941
% 1.47/0.64 # Current number of archived formulas : 0
% 1.47/0.64 # Current number of archived clauses : 141
% 1.47/0.64 # Clause-clause subsumption calls (NU) : 17231
% 1.47/0.64 # Rec. Clause-clause subsumption calls : 8881
% 1.47/0.64 # Non-unit clause-clause subsumptions : 486
% 1.47/0.64 # Unit Clause-clause subsumption calls : 1164
% 1.47/0.64 # Rewrite failures with RHS unbound : 0
% 1.47/0.64 # BW rewrite match attempts : 21
% 1.47/0.64 # BW rewrite match successes : 19
% 1.47/0.64 # Condensation attempts : 0
% 1.47/0.64 # Condensation successes : 0
% 1.47/0.64 # Termbank termtop insertions : 125109
% 1.47/0.64
% 1.47/0.64 # -------------------------------------------------
% 1.47/0.64 # User time : 0.139 s
% 1.47/0.64 # System time : 0.005 s
% 1.47/0.64 # Total time : 0.144 s
% 1.47/0.64 # Maximum resident set size: 1952 pages
% 1.47/0.64
% 1.47/0.64 # -------------------------------------------------
% 1.47/0.64 # User time : 0.667 s
% 1.47/0.64 # System time : 0.027 s
% 1.47/0.64 # Total time : 0.695 s
% 1.47/0.64 # Maximum resident set size: 1748 pages
% 1.47/0.64 % E---3.1 exiting
%------------------------------------------------------------------------------