TSTP Solution File: RNG056+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : RNG056+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.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:53 EDT 2023
% Result : Theorem 10.25s 1.78s
% Output : CNFRefutation 10.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 13
% Syntax : Number of formulae : 53 ( 26 unt; 0 def)
% Number of atoms : 111 ( 43 equ)
% Maximal formula atoms : 16 ( 2 avg)
% Number of connectives : 98 ( 40 ~; 37 |; 19 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 19 ( 19 usr; 14 con; 0-2 aty)
% Number of variables : 33 ( 1 sgn; 10 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mArith,axiom,
! [X1,X2,X3] :
( ( aScalar0(X1)
& aScalar0(X2)
& aScalar0(X3) )
=> ( sdtpldt0(sdtpldt0(X1,X2),X3) = sdtpldt0(X1,sdtpldt0(X2,X3))
& sdtpldt0(X1,X2) = sdtpldt0(X2,X1)
& sdtasdt0(sdtasdt0(X1,X2),X3) = sdtasdt0(X1,sdtasdt0(X2,X3))
& sdtasdt0(X1,X2) = sdtasdt0(X2,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.m7mgOxerHV/E---3.1_9029.p',mArith) ).
fof(m__1873,hypothesis,
( aScalar0(xH)
& xH = sdtasdt0(xA,xB) ),
file('/export/starexec/sandbox/tmp/tmp.m7mgOxerHV/E---3.1_9029.p',m__1873) ).
fof(m__1766,hypothesis,
( aScalar0(xB)
& xB = sdtlbdtrb0(xt,aDimensionOf0(xt)) ),
file('/export/starexec/sandbox/tmp/tmp.m7mgOxerHV/E---3.1_9029.p',m__1766) ).
fof(m__1746,hypothesis,
( aScalar0(xA)
& xA = sdtlbdtrb0(xs,aDimensionOf0(xs)) ),
file('/export/starexec/sandbox/tmp/tmp.m7mgOxerHV/E---3.1_9029.p',m__1746) ).
fof(m__1949,hypothesis,
( aScalar0(xN)
& xN = sdtasdt0(xR,xS) ),
file('/export/starexec/sandbox/tmp/tmp.m7mgOxerHV/E---3.1_9029.p',m__1949) ).
fof(m__1837,hypothesis,
( aScalar0(xF)
& xF = sdtasdt0(xA,xA) ),
file('/export/starexec/sandbox/tmp/tmp.m7mgOxerHV/E---3.1_9029.p',m__1837) ).
fof(m__1854,hypothesis,
( aScalar0(xG)
& xG = sdtasdt0(xB,xB) ),
file('/export/starexec/sandbox/tmp/tmp.m7mgOxerHV/E---3.1_9029.p',m__1854) ).
fof(mMulSc,axiom,
! [X1,X2] :
( ( aScalar0(X1)
& aScalar0(X2) )
=> aScalar0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox/tmp/tmp.m7mgOxerHV/E---3.1_9029.p',mMulSc) ).
fof(m__1930,hypothesis,
( aScalar0(xS)
& xS = sdtasdt0(xF,xD) ),
file('/export/starexec/sandbox/tmp/tmp.m7mgOxerHV/E---3.1_9029.p',m__1930) ).
fof(m__1800,hypothesis,
( aScalar0(xD)
& xD = sdtasasdt0(xq,xq) ),
file('/export/starexec/sandbox/tmp/tmp.m7mgOxerHV/E---3.1_9029.p',m__1800) ).
fof(m__,conjecture,
xN = sdtasdt0(sdtasdt0(xH,xH),sdtasdt0(xC,xD)),
file('/export/starexec/sandbox/tmp/tmp.m7mgOxerHV/E---3.1_9029.p',m__) ).
fof(m__1892,hypothesis,
( aScalar0(xR)
& xR = sdtasdt0(xC,xG) ),
file('/export/starexec/sandbox/tmp/tmp.m7mgOxerHV/E---3.1_9029.p',m__1892) ).
fof(m__1783,hypothesis,
( aScalar0(xC)
& xC = sdtasasdt0(xp,xp) ),
file('/export/starexec/sandbox/tmp/tmp.m7mgOxerHV/E---3.1_9029.p',m__1783) ).
fof(c_0_13,plain,
! [X51,X52,X53] :
( ( sdtpldt0(sdtpldt0(X51,X52),X53) = sdtpldt0(X51,sdtpldt0(X52,X53))
| ~ aScalar0(X51)
| ~ aScalar0(X52)
| ~ aScalar0(X53) )
& ( sdtpldt0(X51,X52) = sdtpldt0(X52,X51)
| ~ aScalar0(X51)
| ~ aScalar0(X52)
| ~ aScalar0(X53) )
& ( sdtasdt0(sdtasdt0(X51,X52),X53) = sdtasdt0(X51,sdtasdt0(X52,X53))
| ~ aScalar0(X51)
| ~ aScalar0(X52)
| ~ aScalar0(X53) )
& ( sdtasdt0(X51,X52) = sdtasdt0(X52,X51)
| ~ aScalar0(X51)
| ~ aScalar0(X52)
| ~ aScalar0(X53) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mArith])])]) ).
cnf(c_0_14,plain,
( sdtasdt0(sdtasdt0(X1,X2),X3) = sdtasdt0(X1,sdtasdt0(X2,X3))
| ~ aScalar0(X1)
| ~ aScalar0(X2)
| ~ aScalar0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_15,hypothesis,
xH = sdtasdt0(xA,xB),
inference(split_conjunct,[status(thm)],[m__1873]) ).
cnf(c_0_16,hypothesis,
aScalar0(xB),
inference(split_conjunct,[status(thm)],[m__1766]) ).
cnf(c_0_17,hypothesis,
aScalar0(xA),
inference(split_conjunct,[status(thm)],[m__1746]) ).
cnf(c_0_18,plain,
( sdtasdt0(X1,X2) = sdtasdt0(X2,X1)
| ~ aScalar0(X1)
| ~ aScalar0(X2)
| ~ aScalar0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,hypothesis,
aScalar0(xN),
inference(split_conjunct,[status(thm)],[m__1949]) ).
cnf(c_0_20,hypothesis,
xF = sdtasdt0(xA,xA),
inference(split_conjunct,[status(thm)],[m__1837]) ).
cnf(c_0_21,hypothesis,
( sdtasdt0(xA,sdtasdt0(xB,X1)) = sdtasdt0(xH,X1)
| ~ aScalar0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_17])]) ).
cnf(c_0_22,hypothesis,
xG = sdtasdt0(xB,xB),
inference(split_conjunct,[status(thm)],[m__1854]) ).
fof(c_0_23,plain,
! [X16,X17] :
( ~ aScalar0(X16)
| ~ aScalar0(X17)
| aScalar0(sdtasdt0(X16,X17)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulSc])]) ).
cnf(c_0_24,hypothesis,
xS = sdtasdt0(xF,xD),
inference(split_conjunct,[status(thm)],[m__1930]) ).
cnf(c_0_25,hypothesis,
( sdtasdt0(X1,X2) = sdtasdt0(X2,X1)
| ~ aScalar0(X2)
| ~ aScalar0(X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_26,hypothesis,
aScalar0(xF),
inference(split_conjunct,[status(thm)],[m__1837]) ).
cnf(c_0_27,hypothesis,
aScalar0(xD),
inference(split_conjunct,[status(thm)],[m__1800]) ).
cnf(c_0_28,hypothesis,
( sdtasdt0(xA,sdtasdt0(xA,X1)) = sdtasdt0(xF,X1)
| ~ aScalar0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_20]),c_0_17])]) ).
cnf(c_0_29,hypothesis,
sdtasdt0(xA,xG) = sdtasdt0(xH,xB),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_16])]) ).
cnf(c_0_30,hypothesis,
aScalar0(xG),
inference(split_conjunct,[status(thm)],[m__1854]) ).
cnf(c_0_31,plain,
( aScalar0(sdtasdt0(X1,X2))
| ~ aScalar0(X1)
| ~ aScalar0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_32,hypothesis,
sdtasdt0(xD,xF) = xS,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),c_0_27])]) ).
cnf(c_0_33,hypothesis,
sdtasdt0(xA,sdtasdt0(xH,xB)) = sdtasdt0(xF,xG),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30])]) ).
cnf(c_0_34,hypothesis,
( sdtasdt0(xA,sdtasdt0(X1,xB)) = sdtasdt0(xH,X1)
| ~ aScalar0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_25]),c_0_16])]) ).
cnf(c_0_35,hypothesis,
aScalar0(xH),
inference(split_conjunct,[status(thm)],[m__1873]) ).
cnf(c_0_36,plain,
( aScalar0(sdtasdt0(X1,sdtasdt0(X2,X3)))
| ~ aScalar0(X3)
| ~ aScalar0(X2)
| ~ aScalar0(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_14]),c_0_31]) ).
fof(c_0_37,negated_conjecture,
xN != sdtasdt0(sdtasdt0(xH,xH),sdtasdt0(xC,xD)),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).
cnf(c_0_38,hypothesis,
( sdtasdt0(xD,sdtasdt0(xF,X1)) = sdtasdt0(xS,X1)
| ~ aScalar0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_32]),c_0_26]),c_0_27])]) ).
cnf(c_0_39,hypothesis,
sdtasdt0(xF,xG) = sdtasdt0(xH,xH),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35])]) ).
cnf(c_0_40,hypothesis,
( aScalar0(sdtasdt0(X1,sdtasdt0(xH,xB)))
| ~ aScalar0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_29]),c_0_30]),c_0_17])]) ).
cnf(c_0_41,hypothesis,
xR = sdtasdt0(xC,xG),
inference(split_conjunct,[status(thm)],[m__1892]) ).
cnf(c_0_42,hypothesis,
aScalar0(xC),
inference(split_conjunct,[status(thm)],[m__1783]) ).
cnf(c_0_43,negated_conjecture,
xN != sdtasdt0(sdtasdt0(xH,xH),sdtasdt0(xC,xD)),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_44,hypothesis,
( sdtasdt0(X1,sdtasdt0(X2,X3)) = sdtasdt0(X2,sdtasdt0(X3,X1))
| ~ aScalar0(X1)
| ~ aScalar0(X3)
| ~ aScalar0(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_25]),c_0_31]) ).
cnf(c_0_45,hypothesis,
sdtasdt0(xD,sdtasdt0(xH,xH)) = sdtasdt0(xS,xG),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_30])]) ).
cnf(c_0_46,hypothesis,
aScalar0(sdtasdt0(xH,xH)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_34]),c_0_17]),c_0_35])]) ).
cnf(c_0_47,hypothesis,
( sdtasdt0(xC,sdtasdt0(xG,X1)) = sdtasdt0(xR,X1)
| ~ aScalar0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_41]),c_0_30]),c_0_42])]) ).
cnf(c_0_48,negated_conjecture,
sdtasdt0(xC,sdtasdt0(xS,xG)) != xN,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]),c_0_46]),c_0_27]),c_0_42])]) ).
cnf(c_0_49,hypothesis,
( sdtasdt0(xC,sdtasdt0(X1,xG)) = sdtasdt0(xR,X1)
| ~ aScalar0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_25]),c_0_30])]) ).
cnf(c_0_50,hypothesis,
xN = sdtasdt0(xR,xS),
inference(split_conjunct,[status(thm)],[m__1949]) ).
cnf(c_0_51,hypothesis,
aScalar0(xS),
inference(split_conjunct,[status(thm)],[m__1930]) ).
cnf(c_0_52,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50]),c_0_51])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : RNG056+1 : TPTP v8.1.2. Released v4.0.0.
% 0.11/0.14 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n016.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 2400
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Mon Oct 2 20:13:51 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.21/0.50 Running first-order theorem proving
% 0.21/0.50 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/tmp/tmp.m7mgOxerHV/E---3.1_9029.p
% 10.25/1.78 # Version: 3.1pre001
% 10.25/1.78 # Preprocessing class: FSLSSMSMSSSNFFN.
% 10.25/1.78 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 10.25/1.78 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 10.25/1.78 # Starting new_bool_3 with 300s (1) cores
% 10.25/1.78 # Starting new_bool_1 with 300s (1) cores
% 10.25/1.78 # Starting sh5l with 300s (1) cores
% 10.25/1.78 # new_bool_3 with pid 9108 completed with status 0
% 10.25/1.78 # Result found by new_bool_3
% 10.25/1.78 # Preprocessing class: FSLSSMSMSSSNFFN.
% 10.25/1.78 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 10.25/1.78 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 10.25/1.78 # Starting new_bool_3 with 300s (1) cores
% 10.25/1.78 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 10.25/1.78 # Search class: FGHSF-FFMM21-MFFFFFNN
% 10.25/1.78 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 10.25/1.78 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 10.25/1.78 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 9112 completed with status 0
% 10.25/1.78 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 10.25/1.78 # Preprocessing class: FSLSSMSMSSSNFFN.
% 10.25/1.78 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 10.25/1.78 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 10.25/1.78 # Starting new_bool_3 with 300s (1) cores
% 10.25/1.78 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 10.25/1.78 # Search class: FGHSF-FFMM21-MFFFFFNN
% 10.25/1.78 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 10.25/1.78 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 10.25/1.78 # Preprocessing time : 0.002 s
% 10.25/1.78 # Presaturation interreduction done
% 10.25/1.78
% 10.25/1.78 # Proof found!
% 10.25/1.78 # SZS status Theorem
% 10.25/1.78 # SZS output start CNFRefutation
% See solution above
% 10.25/1.78 # Parsed axioms : 58
% 10.25/1.78 # Removed by relevancy pruning/SinE : 4
% 10.25/1.78 # Initial clauses : 80
% 10.25/1.78 # Removed in clause preprocessing : 5
% 10.25/1.78 # Initial clauses in saturation : 75
% 10.25/1.78 # Processed clauses : 6355
% 10.25/1.78 # ...of these trivial : 320
% 10.25/1.78 # ...subsumed : 2896
% 10.25/1.78 # ...remaining for further processing : 3139
% 10.25/1.78 # Other redundant clauses eliminated : 3
% 10.25/1.78 # Clauses deleted for lack of memory : 0
% 10.25/1.78 # Backward-subsumed : 80
% 10.25/1.78 # Backward-rewritten : 189
% 10.25/1.78 # Generated clauses : 81455
% 10.25/1.78 # ...of the previous two non-redundant : 79993
% 10.25/1.78 # ...aggressively subsumed : 0
% 10.25/1.78 # Contextual simplify-reflections : 101
% 10.25/1.78 # Paramodulations : 81433
% 10.25/1.78 # Factorizations : 0
% 10.25/1.78 # NegExts : 0
% 10.25/1.78 # Equation resolutions : 22
% 10.25/1.78 # Total rewrite steps : 80587
% 10.25/1.78 # Propositional unsat checks : 0
% 10.25/1.78 # Propositional check models : 0
% 10.25/1.78 # Propositional check unsatisfiable : 0
% 10.25/1.78 # Propositional clauses : 0
% 10.25/1.78 # Propositional clauses after purity: 0
% 10.25/1.78 # Propositional unsat core size : 0
% 10.25/1.78 # Propositional preprocessing time : 0.000
% 10.25/1.78 # Propositional encoding time : 0.000
% 10.25/1.78 # Propositional solver time : 0.000
% 10.25/1.78 # Success case prop preproc time : 0.000
% 10.25/1.78 # Success case prop encoding time : 0.000
% 10.25/1.78 # Success case prop solver time : 0.000
% 10.25/1.78 # Current number of processed clauses : 2792
% 10.25/1.78 # Positive orientable unit clauses : 496
% 10.25/1.78 # Positive unorientable unit clauses: 0
% 10.25/1.78 # Negative unit clauses : 3
% 10.25/1.78 # Non-unit-clauses : 2293
% 10.25/1.78 # Current number of unprocessed clauses: 73628
% 10.25/1.78 # ...number of literals in the above : 299941
% 10.25/1.78 # Current number of archived formulas : 0
% 10.25/1.78 # Current number of archived clauses : 344
% 10.25/1.78 # Clause-clause subsumption calls (NU) : 473044
% 10.25/1.78 # Rec. Clause-clause subsumption calls : 266195
% 10.25/1.78 # Non-unit clause-clause subsumptions : 3062
% 10.25/1.78 # Unit Clause-clause subsumption calls : 7934
% 10.25/1.78 # Rewrite failures with RHS unbound : 0
% 10.25/1.78 # BW rewrite match attempts : 984
% 10.25/1.78 # BW rewrite match successes : 37
% 10.25/1.78 # Condensation attempts : 0
% 10.25/1.78 # Condensation successes : 0
% 10.25/1.78 # Termbank termtop insertions : 2155288
% 10.25/1.78
% 10.25/1.78 # -------------------------------------------------
% 10.25/1.78 # User time : 1.166 s
% 10.25/1.78 # System time : 0.050 s
% 10.25/1.78 # Total time : 1.216 s
% 10.25/1.78 # Maximum resident set size: 2004 pages
% 10.25/1.78
% 10.25/1.78 # -------------------------------------------------
% 10.25/1.78 # User time : 1.168 s
% 10.25/1.78 # System time : 0.052 s
% 10.25/1.78 # Total time : 1.220 s
% 10.25/1.78 # Maximum resident set size: 1744 pages
% 10.25/1.78 % E---3.1 exiting
% 10.25/1.78 % E---3.1 exiting
%------------------------------------------------------------------------------