TSTP Solution File: RNG055+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : RNG055+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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:16 EDT 2024
% Result : Theorem 0.14s 0.43s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 10
% Syntax : Number of formulae : 41 ( 20 unt; 0 def)
% Number of atoms : 89 ( 34 equ)
% Maximal formula atoms : 16 ( 2 avg)
% Number of connectives : 86 ( 38 ~; 30 |; 16 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 18 ( 18 usr; 13 con; 0-2 aty)
% Number of variables : 22 ( 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.DbKXprnaS8/E---3.1_28095.p',mArith) ).
fof(m__1873,hypothesis,
( aScalar0(xH)
& xH = sdtasdt0(xA,xB) ),
file('/export/starexec/sandbox/tmp/tmp.DbKXprnaS8/E---3.1_28095.p',m__1873) ).
fof(m__1766,hypothesis,
( aScalar0(xB)
& xB = sdtlbdtrb0(xt,aDimensionOf0(xt)) ),
file('/export/starexec/sandbox/tmp/tmp.DbKXprnaS8/E---3.1_28095.p',m__1766) ).
fof(m__1746,hypothesis,
( aScalar0(xA)
& xA = sdtlbdtrb0(xs,aDimensionOf0(xs)) ),
file('/export/starexec/sandbox/tmp/tmp.DbKXprnaS8/E---3.1_28095.p',m__1746) ).
fof(m__1854,hypothesis,
( aScalar0(xG)
& xG = sdtasdt0(xB,xB) ),
file('/export/starexec/sandbox/tmp/tmp.DbKXprnaS8/E---3.1_28095.p',m__1854) ).
fof(m__1949,hypothesis,
( aScalar0(xN)
& xN = sdtasdt0(xR,xS) ),
file('/export/starexec/sandbox/tmp/tmp.DbKXprnaS8/E---3.1_28095.p',m__1949) ).
fof(mMulSc,axiom,
! [X1,X2] :
( ( aScalar0(X1)
& aScalar0(X2) )
=> aScalar0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox/tmp/tmp.DbKXprnaS8/E---3.1_28095.p',mMulSc) ).
fof(m__,conjecture,
sdtasdt0(xP,xP) = sdtasdt0(sdtasdt0(xH,xH),sdtasdt0(xE,xE)),
file('/export/starexec/sandbox/tmp/tmp.DbKXprnaS8/E---3.1_28095.p',m__) ).
fof(m__1820,hypothesis,
( aScalar0(xE)
& xE = sdtasasdt0(xp,xq) ),
file('/export/starexec/sandbox/tmp/tmp.DbKXprnaS8/E---3.1_28095.p',m__1820) ).
fof(m__1911,hypothesis,
( aScalar0(xP)
& xP = sdtasdt0(xE,xH) ),
file('/export/starexec/sandbox/tmp/tmp.DbKXprnaS8/E---3.1_28095.p',m__1911) ).
fof(c_0_10,plain,
! [X58,X59,X60] :
( ( sdtpldt0(sdtpldt0(X58,X59),X60) = sdtpldt0(X58,sdtpldt0(X59,X60))
| ~ aScalar0(X58)
| ~ aScalar0(X59)
| ~ aScalar0(X60) )
& ( sdtpldt0(X58,X59) = sdtpldt0(X59,X58)
| ~ aScalar0(X58)
| ~ aScalar0(X59)
| ~ aScalar0(X60) )
& ( sdtasdt0(sdtasdt0(X58,X59),X60) = sdtasdt0(X58,sdtasdt0(X59,X60))
| ~ aScalar0(X58)
| ~ aScalar0(X59)
| ~ aScalar0(X60) )
& ( sdtasdt0(X58,X59) = sdtasdt0(X59,X58)
| ~ aScalar0(X58)
| ~ aScalar0(X59)
| ~ aScalar0(X60) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mArith])])])]) ).
cnf(c_0_11,plain,
( sdtasdt0(sdtasdt0(X1,X2),X3) = sdtasdt0(X1,sdtasdt0(X2,X3))
| ~ aScalar0(X1)
| ~ aScalar0(X2)
| ~ aScalar0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_12,hypothesis,
xH = sdtasdt0(xA,xB),
inference(split_conjunct,[status(thm)],[m__1873]) ).
cnf(c_0_13,hypothesis,
aScalar0(xB),
inference(split_conjunct,[status(thm)],[m__1766]) ).
cnf(c_0_14,hypothesis,
aScalar0(xA),
inference(split_conjunct,[status(thm)],[m__1746]) ).
cnf(c_0_15,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_11,c_0_12]),c_0_13]),c_0_14])]) ).
cnf(c_0_16,hypothesis,
xG = sdtasdt0(xB,xB),
inference(split_conjunct,[status(thm)],[m__1854]) ).
cnf(c_0_17,plain,
( sdtasdt0(X1,X2) = sdtasdt0(X2,X1)
| ~ aScalar0(X1)
| ~ aScalar0(X2)
| ~ aScalar0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,hypothesis,
aScalar0(xN),
inference(split_conjunct,[status(thm)],[m__1949]) ).
cnf(c_0_19,hypothesis,
sdtasdt0(xH,xB) = sdtasdt0(xA,xG),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_13])]) ).
cnf(c_0_20,hypothesis,
( sdtasdt0(X1,X2) = sdtasdt0(X2,X1)
| ~ aScalar0(X2)
| ~ aScalar0(X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,hypothesis,
aScalar0(xH),
inference(split_conjunct,[status(thm)],[m__1873]) ).
fof(c_0_22,plain,
! [X19,X20] :
( ~ aScalar0(X19)
| ~ aScalar0(X20)
| aScalar0(sdtasdt0(X19,X20)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulSc])])]) ).
fof(c_0_23,negated_conjecture,
sdtasdt0(xP,xP) != sdtasdt0(sdtasdt0(xH,xH),sdtasdt0(xE,xE)),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).
cnf(c_0_24,hypothesis,
sdtasdt0(xB,xH) = sdtasdt0(xA,xG),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_13])]) ).
cnf(c_0_25,plain,
( aScalar0(sdtasdt0(X1,X2))
| ~ aScalar0(X1)
| ~ aScalar0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
fof(c_0_26,negated_conjecture,
sdtasdt0(xP,xP) != sdtasdt0(sdtasdt0(xH,xH),sdtasdt0(xE,xE)),
inference(fof_nnf,[status(thm)],[c_0_23]) ).
cnf(c_0_27,hypothesis,
sdtasdt0(xA,sdtasdt0(xA,xG)) = sdtasdt0(xH,xH),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_24]),c_0_21])]) ).
cnf(c_0_28,hypothesis,
aScalar0(sdtasdt0(xA,xG)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_19]),c_0_13]),c_0_21])]) ).
cnf(c_0_29,negated_conjecture,
sdtasdt0(xP,xP) != sdtasdt0(sdtasdt0(xH,xH),sdtasdt0(xE,xE)),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_30,hypothesis,
aScalar0(sdtasdt0(xH,xH)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_27]),c_0_28]),c_0_14])]) ).
cnf(c_0_31,negated_conjecture,
( sdtasdt0(sdtasdt0(xE,xE),sdtasdt0(xH,xH)) != sdtasdt0(xP,xP)
| ~ aScalar0(sdtasdt0(xE,xE)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_20]),c_0_30])]) ).
cnf(c_0_32,hypothesis,
aScalar0(xE),
inference(split_conjunct,[status(thm)],[m__1820]) ).
cnf(c_0_33,hypothesis,
xP = sdtasdt0(xE,xH),
inference(split_conjunct,[status(thm)],[m__1911]) ).
cnf(c_0_34,negated_conjecture,
( sdtasdt0(xE,sdtasdt0(xE,sdtasdt0(xH,xH))) != sdtasdt0(xP,xP)
| ~ aScalar0(sdtasdt0(xE,xE)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_11]),c_0_30]),c_0_32])]) ).
cnf(c_0_35,hypothesis,
( sdtasdt0(xE,sdtasdt0(xH,X1)) = sdtasdt0(xP,X1)
| ~ aScalar0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_33]),c_0_21]),c_0_32])]) ).
cnf(c_0_36,hypothesis,
( sdtasdt0(xE,sdtasdt0(xP,xH)) != sdtasdt0(xP,xP)
| ~ aScalar0(sdtasdt0(xE,xE)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_21])]) ).
cnf(c_0_37,hypothesis,
aScalar0(xP),
inference(split_conjunct,[status(thm)],[m__1911]) ).
cnf(c_0_38,hypothesis,
( sdtasdt0(xE,sdtasdt0(xH,xP)) != sdtasdt0(xP,xP)
| ~ aScalar0(sdtasdt0(xE,xE)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_20]),c_0_21]),c_0_37])]) ).
cnf(c_0_39,hypothesis,
~ aScalar0(sdtasdt0(xE,xE)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_35]),c_0_37])]) ).
cnf(c_0_40,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_25]),c_0_32])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10 % Problem : RNG055+1 : TPTP v8.1.2. Released v4.0.0.
% 0.03/0.11 % Command : run_E %s %d THM
% 0.09/0.30 % Computer : n032.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Fri May 3 11:35:09 EDT 2024
% 0.09/0.30 % CPUTime :
% 0.14/0.39 Running first-order theorem proving
% 0.14/0.39 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.DbKXprnaS8/E---3.1_28095.p
% 0.14/0.43 # Version: 3.1.0
% 0.14/0.43 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.43 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.43 # Starting sh5l with 300s (1) cores
% 0.14/0.43 # new_bool_3 with pid 28179 completed with status 0
% 0.14/0.43 # Result found by new_bool_3
% 0.14/0.43 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.43 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.43 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.14/0.43 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.14/0.43 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 28183 completed with status 0
% 0.14/0.43 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.43 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.43 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.43 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.14/0.43 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.14/0.43 # Preprocessing time : 0.001 s
% 0.14/0.43 # Presaturation interreduction done
% 0.14/0.43
% 0.14/0.43 # Proof found!
% 0.14/0.43 # SZS status Theorem
% 0.14/0.43 # SZS output start CNFRefutation
% See solution above
% 0.14/0.43 # Parsed axioms : 57
% 0.14/0.43 # Removed by relevancy pruning/SinE : 4
% 0.14/0.43 # Initial clauses : 79
% 0.14/0.43 # Removed in clause preprocessing : 5
% 0.14/0.43 # Initial clauses in saturation : 74
% 0.14/0.43 # Processed clauses : 456
% 0.14/0.43 # ...of these trivial : 4
% 0.14/0.43 # ...subsumed : 89
% 0.14/0.43 # ...remaining for further processing : 363
% 0.14/0.43 # Other redundant clauses eliminated : 3
% 0.14/0.43 # Clauses deleted for lack of memory : 0
% 0.14/0.43 # Backward-subsumed : 10
% 0.14/0.43 # Backward-rewritten : 1
% 0.14/0.43 # Generated clauses : 1502
% 0.14/0.43 # ...of the previous two non-redundant : 1376
% 0.14/0.43 # ...aggressively subsumed : 0
% 0.14/0.43 # Contextual simplify-reflections : 3
% 0.14/0.43 # Paramodulations : 1498
% 0.14/0.43 # Factorizations : 0
% 0.14/0.43 # NegExts : 0
% 0.14/0.43 # Equation resolutions : 4
% 0.14/0.43 # Disequality decompositions : 0
% 0.14/0.43 # Total rewrite steps : 1088
% 0.14/0.43 # ...of those cached : 1042
% 0.14/0.43 # Propositional unsat checks : 0
% 0.14/0.43 # Propositional check models : 0
% 0.14/0.43 # Propositional check unsatisfiable : 0
% 0.14/0.43 # Propositional clauses : 0
% 0.14/0.43 # Propositional clauses after purity: 0
% 0.14/0.43 # Propositional unsat core size : 0
% 0.14/0.43 # Propositional preprocessing time : 0.000
% 0.14/0.43 # Propositional encoding time : 0.000
% 0.14/0.43 # Propositional solver time : 0.000
% 0.14/0.43 # Success case prop preproc time : 0.000
% 0.14/0.43 # Success case prop encoding time : 0.000
% 0.14/0.43 # Success case prop solver time : 0.000
% 0.14/0.43 # Current number of processed clauses : 275
% 0.14/0.43 # Positive orientable unit clauses : 72
% 0.14/0.43 # Positive unorientable unit clauses: 0
% 0.14/0.43 # Negative unit clauses : 3
% 0.14/0.43 # Non-unit-clauses : 200
% 0.14/0.43 # Current number of unprocessed clauses: 1050
% 0.14/0.43 # ...number of literals in the above : 4005
% 0.14/0.43 # Current number of archived formulas : 0
% 0.14/0.43 # Current number of archived clauses : 85
% 0.14/0.43 # Clause-clause subsumption calls (NU) : 6690
% 0.14/0.43 # Rec. Clause-clause subsumption calls : 3960
% 0.14/0.43 # Non-unit clause-clause subsumptions : 84
% 0.14/0.43 # Unit Clause-clause subsumption calls : 476
% 0.14/0.43 # Rewrite failures with RHS unbound : 0
% 0.14/0.43 # BW rewrite match attempts : 1
% 0.14/0.43 # BW rewrite match successes : 1
% 0.14/0.43 # Condensation attempts : 0
% 0.14/0.43 # Condensation successes : 0
% 0.14/0.43 # Termbank termtop insertions : 29938
% 0.14/0.43 # Search garbage collected termcells : 885
% 0.14/0.43
% 0.14/0.43 # -------------------------------------------------
% 0.14/0.43 # User time : 0.026 s
% 0.14/0.43 # System time : 0.005 s
% 0.14/0.43 # Total time : 0.031 s
% 0.14/0.43 # Maximum resident set size: 2028 pages
% 0.14/0.43
% 0.14/0.43 # -------------------------------------------------
% 0.14/0.43 # User time : 0.028 s
% 0.14/0.43 # System time : 0.006 s
% 0.14/0.43 # Total time : 0.034 s
% 0.14/0.43 # Maximum resident set size: 1760 pages
% 0.14/0.43 % E---3.1 exiting
% 0.14/0.43 % E exiting
%------------------------------------------------------------------------------