TSTP Solution File: RNG045+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : RNG045+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.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:50 EDT 2023
% Result : Theorem 0.21s 0.52s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of formulae : 15 ( 11 unt; 0 def)
% Number of atoms : 32 ( 11 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 29 ( 12 ~; 9 |; 7 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 9 ( 0 sgn; 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv)) = sdtpldt0(sdtpldt0(sdtasdt0(xx,xu),sdtasdt0(xx,xv)),sdtpldt0(sdtasdt0(xy,xu),sdtasdt0(xy,xv))),
file('/export/starexec/sandbox2/tmp/tmp.welCtYsH5W/E---3.1_24726.p',m__) ).
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.welCtYsH5W/E---3.1_24726.p',mDistr) ).
fof(m__674,hypothesis,
( aScalar0(xx)
& aScalar0(xy)
& aScalar0(xu)
& aScalar0(xv) ),
file('/export/starexec/sandbox2/tmp/tmp.welCtYsH5W/E---3.1_24726.p',m__674) ).
fof(m__733,hypothesis,
sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv)) = sdtpldt0(sdtasdt0(xx,sdtpldt0(xu,xv)),sdtasdt0(xy,sdtpldt0(xu,xv))),
file('/export/starexec/sandbox2/tmp/tmp.welCtYsH5W/E---3.1_24726.p',m__733) ).
fof(c_0_4,negated_conjecture,
sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv)) != sdtpldt0(sdtpldt0(sdtasdt0(xx,xu),sdtasdt0(xx,xv)),sdtpldt0(sdtasdt0(xy,xu),sdtasdt0(xy,xv))),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).
fof(c_0_5,plain,
! [X11,X12,X13] :
( ( sdtasdt0(X11,sdtpldt0(X12,X13)) = sdtpldt0(sdtasdt0(X11,X12),sdtasdt0(X11,X13))
| ~ aScalar0(X11)
| ~ aScalar0(X12)
| ~ aScalar0(X13) )
& ( sdtasdt0(sdtpldt0(X11,X12),X13) = sdtpldt0(sdtasdt0(X11,X13),sdtasdt0(X12,X13))
| ~ aScalar0(X11)
| ~ aScalar0(X12)
| ~ aScalar0(X13) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDistr])])]) ).
cnf(c_0_6,negated_conjecture,
sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv)) != sdtpldt0(sdtpldt0(sdtasdt0(xx,xu),sdtasdt0(xx,xv)),sdtpldt0(sdtasdt0(xy,xu),sdtasdt0(xy,xv))),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,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_5]) ).
cnf(c_0_8,hypothesis,
aScalar0(xv),
inference(split_conjunct,[status(thm)],[m__674]) ).
cnf(c_0_9,hypothesis,
aScalar0(xu),
inference(split_conjunct,[status(thm)],[m__674]) ).
cnf(c_0_10,hypothesis,
aScalar0(xy),
inference(split_conjunct,[status(thm)],[m__674]) ).
cnf(c_0_11,negated_conjecture,
sdtpldt0(sdtpldt0(sdtasdt0(xx,xu),sdtasdt0(xx,xv)),sdtasdt0(xy,sdtpldt0(xu,xv))) != sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]),c_0_9]),c_0_10])]) ).
cnf(c_0_12,hypothesis,
sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv)) = sdtpldt0(sdtasdt0(xx,sdtpldt0(xu,xv)),sdtasdt0(xy,sdtpldt0(xu,xv))),
inference(split_conjunct,[status(thm)],[m__733]) ).
cnf(c_0_13,hypothesis,
aScalar0(xx),
inference(split_conjunct,[status(thm)],[m__674]) ).
cnf(c_0_14,negated_conjecture,
$false,
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_11,c_0_7]),c_0_12]),c_0_8]),c_0_9]),c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : RNG045+1 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n004.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 2400
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Mon Oct 2 19:34:30 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.21/0.50 Running first-order theorem proving
% 0.21/0.50 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.welCtYsH5W/E---3.1_24726.p
% 0.21/0.52 # Version: 3.1pre001
% 0.21/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.52 # Starting sh5l with 300s (1) cores
% 0.21/0.52 # new_bool_3 with pid 24868 completed with status 0
% 0.21/0.52 # Result found by new_bool_3
% 0.21/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.52 # Search class: FHUSF-FFSS22-MFFFFFNN
% 0.21/0.52 # partial match(1): FHUSM-FFSS22-MFFFFFNN
% 0.21/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.52 # SAT001_MinMin_p005000_rr_RG with pid 24873 completed with status 0
% 0.21/0.52 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.52 # Search class: FHUSF-FFSS22-MFFFFFNN
% 0.21/0.52 # partial match(1): FHUSM-FFSS22-MFFFFFNN
% 0.21/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.52 # Preprocessing time : 0.001 s
% 0.21/0.52 # Presaturation interreduction done
% 0.21/0.52
% 0.21/0.52 # Proof found!
% 0.21/0.52 # SZS status Theorem
% 0.21/0.52 # SZS output start CNFRefutation
% See solution above
% 0.21/0.52 # Parsed axioms : 18
% 0.21/0.52 # Removed by relevancy pruning/SinE : 10
% 0.21/0.52 # Initial clauses : 15
% 0.21/0.52 # Removed in clause preprocessing : 1
% 0.21/0.52 # Initial clauses in saturation : 14
% 0.21/0.52 # Processed clauses : 33
% 0.21/0.52 # ...of these trivial : 0
% 0.21/0.52 # ...subsumed : 2
% 0.21/0.52 # ...remaining for further processing : 31
% 0.21/0.52 # Other redundant clauses eliminated : 0
% 0.21/0.52 # Clauses deleted for lack of memory : 0
% 0.21/0.52 # Backward-subsumed : 1
% 0.21/0.52 # Backward-rewritten : 0
% 0.21/0.52 # Generated clauses : 48
% 0.21/0.52 # ...of the previous two non-redundant : 44
% 0.21/0.52 # ...aggressively subsumed : 0
% 0.21/0.52 # Contextual simplify-reflections : 0
% 0.21/0.52 # Paramodulations : 48
% 0.21/0.52 # Factorizations : 0
% 0.21/0.52 # NegExts : 0
% 0.21/0.52 # Equation resolutions : 0
% 0.21/0.52 # Total rewrite steps : 20
% 0.21/0.52 # Propositional unsat checks : 0
% 0.21/0.52 # Propositional check models : 0
% 0.21/0.52 # Propositional check unsatisfiable : 0
% 0.21/0.52 # Propositional clauses : 0
% 0.21/0.52 # Propositional clauses after purity: 0
% 0.21/0.52 # Propositional unsat core size : 0
% 0.21/0.52 # Propositional preprocessing time : 0.000
% 0.21/0.52 # Propositional encoding time : 0.000
% 0.21/0.52 # Propositional solver time : 0.000
% 0.21/0.52 # Success case prop preproc time : 0.000
% 0.21/0.52 # Success case prop encoding time : 0.000
% 0.21/0.52 # Success case prop solver time : 0.000
% 0.21/0.52 # Current number of processed clauses : 16
% 0.21/0.52 # Positive orientable unit clauses : 5
% 0.21/0.52 # Positive unorientable unit clauses: 0
% 0.21/0.52 # Negative unit clauses : 2
% 0.21/0.52 # Non-unit-clauses : 9
% 0.21/0.52 # Current number of unprocessed clauses: 39
% 0.21/0.52 # ...number of literals in the above : 167
% 0.21/0.52 # Current number of archived formulas : 0
% 0.21/0.52 # Current number of archived clauses : 15
% 0.21/0.52 # Clause-clause subsumption calls (NU) : 67
% 0.21/0.52 # Rec. Clause-clause subsumption calls : 55
% 0.21/0.52 # Non-unit clause-clause subsumptions : 3
% 0.21/0.52 # Unit Clause-clause subsumption calls : 2
% 0.21/0.52 # Rewrite failures with RHS unbound : 0
% 0.21/0.52 # BW rewrite match attempts : 0
% 0.21/0.52 # BW rewrite match successes : 0
% 0.21/0.52 # Condensation attempts : 0
% 0.21/0.52 # Condensation successes : 0
% 0.21/0.52 # Termbank termtop insertions : 1960
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.006 s
% 0.21/0.52 # System time : 0.001 s
% 0.21/0.52 # Total time : 0.007 s
% 0.21/0.52 # Maximum resident set size: 1724 pages
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.008 s
% 0.21/0.52 # System time : 0.003 s
% 0.21/0.52 # Total time : 0.011 s
% 0.21/0.52 # Maximum resident set size: 1696 pages
% 0.21/0.52 % E---3.1 exiting
% 0.21/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------