TSTP Solution File: RNG077+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : RNG077+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n007.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:01 EDT 2023
% Result : Theorem 0.84s 0.61s
% Output : CNFRefutation 0.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 9
% Syntax : Number of formulae : 38 ( 12 unt; 0 def)
% Number of atoms : 110 ( 33 equ)
% Maximal formula atoms : 16 ( 2 avg)
% Number of connectives : 131 ( 59 ~; 50 |; 18 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 10 con; 0-2 aty)
% Number of variables : 44 ( 2 sgn; 20 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
sdtpldt0(sdtpldt0(xP,xP),sdtasdt0(xH,xH)) = sdtpldt0(sdtasdt0(xE,xH),sdtpldt0(sdtasdt0(xH,xE),sdtasdt0(xH,xH))),
file('/export/starexec/sandbox2/tmp/tmp.tEwZZi2O71/E---3.1_11238.p',m__) ).
fof(m__1911,hypothesis,
( aScalar0(xP)
& xP = sdtasdt0(xE,xH) ),
file('/export/starexec/sandbox2/tmp/tmp.tEwZZi2O71/E---3.1_11238.p',m__1911) ).
fof(mDistr,axiom,
! [X1,X2,X3] :
( ( aScalar0(X1)
& aScalar0(X2)
& aScalar0(X3) )
=> ( sdtasdt0(X1,sdtpldt0(X2,X3)) = sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))
& sdtasdt0(sdtpldt0(X1,X2),X3) = sdtpldt0(sdtasdt0(X1,X3),sdtasdt0(X2,X3)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.tEwZZi2O71/E---3.1_11238.p',mDistr) ).
fof(m__1873,hypothesis,
( aScalar0(xH)
& xH = sdtasdt0(xA,xB) ),
file('/export/starexec/sandbox2/tmp/tmp.tEwZZi2O71/E---3.1_11238.p',m__1873) ).
fof(m__1820,hypothesis,
( aScalar0(xE)
& xE = sdtasasdt0(xp,xq) ),
file('/export/starexec/sandbox2/tmp/tmp.tEwZZi2O71/E---3.1_11238.p',m__1820) ).
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/sandbox2/tmp/tmp.tEwZZi2O71/E---3.1_11238.p',mArith) ).
fof(m__1949,hypothesis,
( aScalar0(xN)
& xN = sdtasdt0(xR,xS) ),
file('/export/starexec/sandbox2/tmp/tmp.tEwZZi2O71/E---3.1_11238.p',m__1949) ).
fof(mSumSc,axiom,
! [X1,X2] :
( ( aScalar0(X1)
& aScalar0(X2) )
=> aScalar0(sdtpldt0(X1,X2)) ),
file('/export/starexec/sandbox2/tmp/tmp.tEwZZi2O71/E---3.1_11238.p',mSumSc) ).
fof(mMulSc,axiom,
! [X1,X2] :
( ( aScalar0(X1)
& aScalar0(X2) )
=> aScalar0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox2/tmp/tmp.tEwZZi2O71/E---3.1_11238.p',mMulSc) ).
fof(c_0_9,negated_conjecture,
sdtpldt0(sdtpldt0(xP,xP),sdtasdt0(xH,xH)) != sdtpldt0(sdtasdt0(xE,xH),sdtpldt0(sdtasdt0(xH,xE),sdtasdt0(xH,xH))),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).
cnf(c_0_10,negated_conjecture,
sdtpldt0(sdtpldt0(xP,xP),sdtasdt0(xH,xH)) != sdtpldt0(sdtasdt0(xE,xH),sdtpldt0(sdtasdt0(xH,xE),sdtasdt0(xH,xH))),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_11,hypothesis,
xP = sdtasdt0(xE,xH),
inference(split_conjunct,[status(thm)],[m__1911]) ).
fof(c_0_12,plain,
! [X44,X45,X46] :
( ( sdtasdt0(X44,sdtpldt0(X45,X46)) = sdtpldt0(sdtasdt0(X44,X45),sdtasdt0(X44,X46))
| ~ aScalar0(X44)
| ~ aScalar0(X45)
| ~ aScalar0(X46) )
& ( sdtasdt0(sdtpldt0(X44,X45),X46) = sdtpldt0(sdtasdt0(X44,X46),sdtasdt0(X45,X46))
| ~ aScalar0(X44)
| ~ aScalar0(X45)
| ~ aScalar0(X46) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDistr])])]) ).
cnf(c_0_13,negated_conjecture,
sdtpldt0(xP,sdtpldt0(sdtasdt0(xH,xE),sdtasdt0(xH,xH))) != sdtpldt0(sdtpldt0(xP,xP),sdtasdt0(xH,xH)),
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,plain,
( sdtasdt0(X1,sdtpldt0(X2,X3)) = sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))
| ~ aScalar0(X1)
| ~ aScalar0(X2)
| ~ aScalar0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_15,hypothesis,
aScalar0(xH),
inference(split_conjunct,[status(thm)],[m__1873]) ).
cnf(c_0_16,hypothesis,
aScalar0(xE),
inference(split_conjunct,[status(thm)],[m__1820]) ).
fof(c_0_17,plain,
! [X41,X42,X43] :
( ( sdtpldt0(sdtpldt0(X41,X42),X43) = sdtpldt0(X41,sdtpldt0(X42,X43))
| ~ aScalar0(X41)
| ~ aScalar0(X42)
| ~ aScalar0(X43) )
& ( sdtpldt0(X41,X42) = sdtpldt0(X42,X41)
| ~ aScalar0(X41)
| ~ aScalar0(X42)
| ~ aScalar0(X43) )
& ( sdtasdt0(sdtasdt0(X41,X42),X43) = sdtasdt0(X41,sdtasdt0(X42,X43))
| ~ aScalar0(X41)
| ~ aScalar0(X42)
| ~ aScalar0(X43) )
& ( sdtasdt0(X41,X42) = sdtasdt0(X42,X41)
| ~ aScalar0(X41)
| ~ aScalar0(X42)
| ~ aScalar0(X43) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mArith])])]) ).
cnf(c_0_18,negated_conjecture,
sdtpldt0(sdtpldt0(xP,xP),sdtasdt0(xH,xH)) != sdtpldt0(xP,sdtasdt0(xH,sdtpldt0(xE,xH))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]),c_0_16])]) ).
cnf(c_0_19,plain,
( sdtpldt0(sdtpldt0(X1,X2),X3) = sdtpldt0(X1,sdtpldt0(X2,X3))
| ~ aScalar0(X1)
| ~ aScalar0(X2)
| ~ aScalar0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_20,hypothesis,
aScalar0(xP),
inference(split_conjunct,[status(thm)],[m__1911]) ).
cnf(c_0_21,plain,
( sdtasdt0(sdtpldt0(X1,X2),X3) = sdtpldt0(sdtasdt0(X1,X3),sdtasdt0(X2,X3))
| ~ aScalar0(X1)
| ~ aScalar0(X2)
| ~ aScalar0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_22,negated_conjecture,
( sdtpldt0(xP,sdtpldt0(xP,sdtasdt0(xH,xH))) != sdtpldt0(xP,sdtasdt0(xH,sdtpldt0(xE,xH)))
| ~ aScalar0(sdtasdt0(xH,xH)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]) ).
cnf(c_0_23,hypothesis,
( sdtpldt0(xP,sdtasdt0(X1,xH)) = sdtasdt0(sdtpldt0(xE,X1),xH)
| ~ aScalar0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_11]),c_0_15]),c_0_16])]) ).
cnf(c_0_24,plain,
( sdtpldt0(X1,X2) = sdtpldt0(X2,X1)
| ~ aScalar0(X1)
| ~ aScalar0(X2)
| ~ aScalar0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,hypothesis,
aScalar0(xN),
inference(split_conjunct,[status(thm)],[m__1949]) ).
cnf(c_0_26,negated_conjecture,
( sdtpldt0(xP,sdtasdt0(sdtpldt0(xE,xH),xH)) != sdtpldt0(xP,sdtasdt0(xH,sdtpldt0(xE,xH)))
| ~ aScalar0(sdtasdt0(xH,xH)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_15])]) ).
cnf(c_0_27,hypothesis,
( sdtpldt0(X1,X2) = sdtpldt0(X2,X1)
| ~ aScalar0(X2)
| ~ aScalar0(X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,plain,
( sdtasdt0(X1,X2) = sdtasdt0(X2,X1)
| ~ aScalar0(X1)
| ~ aScalar0(X2)
| ~ aScalar0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_29,negated_conjecture,
( sdtpldt0(xP,sdtasdt0(sdtpldt0(xH,xE),xH)) != sdtpldt0(xP,sdtasdt0(xH,sdtpldt0(xH,xE)))
| ~ aScalar0(sdtasdt0(xH,xH)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_16]),c_0_15])]) ).
cnf(c_0_30,hypothesis,
( sdtasdt0(X1,X2) = sdtasdt0(X2,X1)
| ~ aScalar0(X2)
| ~ aScalar0(X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_25]) ).
fof(c_0_31,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_32,negated_conjecture,
( ~ aScalar0(sdtasdt0(xH,xH))
| ~ aScalar0(sdtpldt0(xH,xE)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_15])]) ).
cnf(c_0_33,plain,
( aScalar0(sdtpldt0(X1,X2))
| ~ aScalar0(X1)
| ~ aScalar0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
fof(c_0_34,plain,
! [X20,X21] :
( ~ aScalar0(X20)
| ~ aScalar0(X21)
| aScalar0(sdtasdt0(X20,X21)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulSc])]) ).
cnf(c_0_35,negated_conjecture,
~ aScalar0(sdtasdt0(xH,xH)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_16]),c_0_15])]) ).
cnf(c_0_36,plain,
( aScalar0(sdtasdt0(X1,X2))
| ~ aScalar0(X1)
| ~ aScalar0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_37,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : RNG077+1 : TPTP v8.1.2. Released v4.0.0.
% 0.11/0.15 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n007.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 19:39:24 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.21/0.53 Running first-order theorem proving
% 0.21/0.53 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.tEwZZi2O71/E---3.1_11238.p
% 0.84/0.61 # Version: 3.1pre001
% 0.84/0.61 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.84/0.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.84/0.61 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.84/0.61 # Starting new_bool_3 with 300s (1) cores
% 0.84/0.61 # Starting new_bool_1 with 300s (1) cores
% 0.84/0.61 # Starting sh5l with 300s (1) cores
% 0.84/0.61 # new_bool_3 with pid 11350 completed with status 0
% 0.84/0.61 # Result found by new_bool_3
% 0.84/0.61 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.84/0.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.84/0.61 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.84/0.61 # Starting new_bool_3 with 300s (1) cores
% 0.84/0.61 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.84/0.61 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.84/0.61 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.84/0.61 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.84/0.61 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 11353 completed with status 0
% 0.84/0.61 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.84/0.61 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.84/0.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.84/0.61 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.84/0.61 # Starting new_bool_3 with 300s (1) cores
% 0.84/0.61 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.84/0.61 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.84/0.61 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.84/0.61 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.84/0.61 # Preprocessing time : 0.002 s
% 0.84/0.61 # Presaturation interreduction done
% 0.84/0.61
% 0.84/0.61 # Proof found!
% 0.84/0.61 # SZS status Theorem
% 0.84/0.61 # SZS output start CNFRefutation
% See solution above
% 0.84/0.61 # Parsed axioms : 59
% 0.84/0.61 # Removed by relevancy pruning/SinE : 4
% 0.84/0.61 # Initial clauses : 81
% 0.84/0.61 # Removed in clause preprocessing : 5
% 0.84/0.61 # Initial clauses in saturation : 76
% 0.84/0.61 # Processed clauses : 581
% 0.84/0.61 # ...of these trivial : 2
% 0.84/0.61 # ...subsumed : 151
% 0.84/0.61 # ...remaining for further processing : 428
% 0.84/0.61 # Other redundant clauses eliminated : 3
% 0.84/0.61 # Clauses deleted for lack of memory : 0
% 0.84/0.61 # Backward-subsumed : 12
% 0.84/0.61 # Backward-rewritten : 17
% 0.84/0.61 # Generated clauses : 2190
% 0.84/0.61 # ...of the previous two non-redundant : 2075
% 0.84/0.61 # ...aggressively subsumed : 0
% 0.84/0.61 # Contextual simplify-reflections : 7
% 0.84/0.61 # Paramodulations : 2186
% 0.84/0.61 # Factorizations : 0
% 0.84/0.61 # NegExts : 0
% 0.84/0.61 # Equation resolutions : 4
% 0.84/0.61 # Total rewrite steps : 1699
% 0.84/0.61 # Propositional unsat checks : 0
% 0.84/0.61 # Propositional check models : 0
% 0.84/0.61 # Propositional check unsatisfiable : 0
% 0.84/0.61 # Propositional clauses : 0
% 0.84/0.61 # Propositional clauses after purity: 0
% 0.84/0.61 # Propositional unsat core size : 0
% 0.84/0.61 # Propositional preprocessing time : 0.000
% 0.84/0.61 # Propositional encoding time : 0.000
% 0.84/0.61 # Propositional solver time : 0.000
% 0.84/0.61 # Success case prop preproc time : 0.000
% 0.84/0.61 # Success case prop encoding time : 0.000
% 0.84/0.61 # Success case prop solver time : 0.000
% 0.84/0.61 # Current number of processed clauses : 320
% 0.84/0.61 # Positive orientable unit clauses : 66
% 0.84/0.61 # Positive unorientable unit clauses: 0
% 0.84/0.61 # Negative unit clauses : 4
% 0.84/0.61 # Non-unit-clauses : 250
% 0.84/0.61 # Current number of unprocessed clauses: 1628
% 0.84/0.61 # ...number of literals in the above : 7282
% 0.84/0.61 # Current number of archived formulas : 0
% 0.84/0.61 # Current number of archived clauses : 105
% 0.84/0.61 # Clause-clause subsumption calls (NU) : 12820
% 0.84/0.61 # Rec. Clause-clause subsumption calls : 7997
% 0.84/0.61 # Non-unit clause-clause subsumptions : 155
% 0.84/0.61 # Unit Clause-clause subsumption calls : 426
% 0.84/0.61 # Rewrite failures with RHS unbound : 0
% 0.84/0.61 # BW rewrite match attempts : 5
% 0.84/0.61 # BW rewrite match successes : 5
% 0.84/0.61 # Condensation attempts : 0
% 0.84/0.61 # Condensation successes : 0
% 0.84/0.61 # Termbank termtop insertions : 57440
% 0.84/0.61
% 0.84/0.61 # -------------------------------------------------
% 0.84/0.61 # User time : 0.061 s
% 0.84/0.61 # System time : 0.006 s
% 0.84/0.61 # Total time : 0.067 s
% 0.84/0.61 # Maximum resident set size: 2036 pages
% 0.84/0.61
% 0.84/0.61 # -------------------------------------------------
% 0.84/0.61 # User time : 0.064 s
% 0.84/0.61 # System time : 0.009 s
% 0.84/0.61 # Total time : 0.072 s
% 0.84/0.61 # Maximum resident set size: 1744 pages
% 0.84/0.61 % E---3.1 exiting
% 0.84/0.61 % E---3.1 exiting
%------------------------------------------------------------------------------