TSTP Solution File: NUM851+2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NUM851+2 : TPTP v8.1.2. Released v4.1.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 : 300s
% WCLimit : 300s
% DateTime : Sat May 4 08:58:12 EDT 2024
% Result : Theorem 272.23s 136.63s
% Output : CNFRefutation 272.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 12 ( 12 unt; 0 def)
% Number of atoms : 12 ( 11 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 15 ( 0 sgn 10 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof('holds(conseq_conjunct2(conseq(302)), 475, 1)',conjecture,
vmul(vplus(vd471,vd473),vd469) = vplus(vmul(vd471,vd469),vmul(vd473,vd469)),
file('/export/starexec/sandbox/tmp/tmp.T5u3QyyfAy/E---3.1_865.p','holds(conseq_conjunct2(conseq(302)), 475, 1)') ).
fof('ass(cond(270, 0), 0)',axiom,
! [X7,X8] : vmul(X7,X8) = vmul(X8,X7),
file('/export/starexec/sandbox/tmp/tmp.T5u3QyyfAy/E---3.1_865.p','ass(cond(270, 0), 0)') ).
fof('ass(cond(281, 0), 0)',axiom,
! [X4,X5,X6] : vmul(X4,vplus(X5,X6)) = vplus(vmul(X4,X5),vmul(X4,X6)),
file('/export/starexec/sandbox/tmp/tmp.T5u3QyyfAy/E---3.1_865.p','ass(cond(281, 0), 0)') ).
fof(c_0_3,negated_conjecture,
vmul(vplus(vd471,vd473),vd469) != vplus(vmul(vd471,vd469),vmul(vd473,vd469)),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],['holds(conseq_conjunct2(conseq(302)), 475, 1)'])]) ).
fof(c_0_4,negated_conjecture,
vmul(vplus(vd471,vd473),vd469) != vplus(vmul(vd471,vd469),vmul(vd473,vd469)),
inference(fof_nnf,[status(thm)],[c_0_3]) ).
fof(c_0_5,plain,
! [X74,X75] : vmul(X74,X75) = vmul(X75,X74),
inference(variable_rename,[status(thm)],['ass(cond(270, 0), 0)']) ).
cnf(c_0_6,negated_conjecture,
vmul(vplus(vd471,vd473),vd469) != vplus(vmul(vd471,vd469),vmul(vd473,vd469)),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
vmul(X1,X2) = vmul(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_8,plain,
! [X71,X72,X73] : vmul(X71,vplus(X72,X73)) = vplus(vmul(X71,X72),vmul(X71,X73)),
inference(variable_rename,[status(thm)],['ass(cond(281, 0), 0)']) ).
cnf(c_0_9,negated_conjecture,
vmul(vd469,vplus(vd471,vd473)) != vplus(vmul(vd471,vd469),vmul(vd469,vd473)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7]),c_0_7]) ).
cnf(c_0_10,plain,
vmul(X1,vplus(X2,X3)) = vplus(vmul(X1,X2),vmul(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10]),c_0_7])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : NUM851+2 : TPTP v8.1.2. Released v4.1.0.
% 0.08/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 : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Fri May 3 09:08:05 EDT 2024
% 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.T5u3QyyfAy/E---3.1_865.p
% 272.23/136.63 # Version: 3.1.0
% 272.23/136.63 # Preprocessing class: FSMSSMSSSSSNFFN.
% 272.23/136.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 272.23/136.63 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 272.23/136.63 # Starting new_bool_3 with 300s (1) cores
% 272.23/136.63 # Starting new_bool_1 with 300s (1) cores
% 272.23/136.63 # Starting sh5l with 300s (1) cores
% 272.23/136.63 # new_bool_3 with pid 984 completed with status 0
% 272.23/136.63 # Result found by new_bool_3
% 272.23/136.63 # Preprocessing class: FSMSSMSSSSSNFFN.
% 272.23/136.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 272.23/136.63 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 272.23/136.63 # Starting new_bool_3 with 300s (1) cores
% 272.23/136.63 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 272.23/136.63 # Search class: FGHSM-FFMS21-SFFFFFNN
% 272.23/136.63 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 272.23/136.63 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 181s (1) cores
% 272.23/136.63 # G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with pid 991 completed with status 0
% 272.23/136.63 # Result found by G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y
% 272.23/136.63 # Preprocessing class: FSMSSMSSSSSNFFN.
% 272.23/136.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 272.23/136.63 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 272.23/136.63 # Starting new_bool_3 with 300s (1) cores
% 272.23/136.63 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 272.23/136.63 # Search class: FGHSM-FFMS21-SFFFFFNN
% 272.23/136.63 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 272.23/136.63 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 181s (1) cores
% 272.23/136.63 # Preprocessing time : 0.001 s
% 272.23/136.63 # Presaturation interreduction done
% 272.23/136.63
% 272.23/136.63 # Proof found!
% 272.23/136.63 # SZS status Theorem
% 272.23/136.63 # SZS output start CNFRefutation
% See solution above
% 272.23/136.63 # Parsed axioms : 27
% 272.23/136.63 # Removed by relevancy pruning/SinE : 3
% 272.23/136.63 # Initial clauses : 27
% 272.23/136.63 # Removed in clause preprocessing : 0
% 272.23/136.63 # Initial clauses in saturation : 27
% 272.23/136.63 # Processed clauses : 32
% 272.23/136.63 # ...of these trivial : 1
% 272.23/136.63 # ...subsumed : 2
% 272.23/136.63 # ...remaining for further processing : 29
% 272.23/136.63 # Other redundant clauses eliminated : 4
% 272.23/136.63 # Clauses deleted for lack of memory : 0
% 272.23/136.63 # Backward-subsumed : 0
% 272.23/136.63 # Backward-rewritten : 4
% 272.23/136.63 # Generated clauses : 4
% 272.23/136.63 # ...of the previous two non-redundant : 6
% 272.23/136.63 # ...aggressively subsumed : 0
% 272.23/136.63 # Contextual simplify-reflections : 0
% 272.23/136.63 # Paramodulations : 0
% 272.23/136.63 # Factorizations : 0
% 272.23/136.63 # NegExts : 0
% 272.23/136.63 # Equation resolutions : 4
% 272.23/136.63 # Disequality decompositions : 0
% 272.23/136.63 # Total rewrite steps : 11
% 272.23/136.63 # ...of those cached : 0
% 272.23/136.63 # Propositional unsat checks : 0
% 272.23/136.63 # Propositional check models : 0
% 272.23/136.63 # Propositional check unsatisfiable : 0
% 272.23/136.63 # Propositional clauses : 0
% 272.23/136.63 # Propositional clauses after purity: 0
% 272.23/136.63 # Propositional unsat core size : 0
% 272.23/136.63 # Propositional preprocessing time : 0.000
% 272.23/136.63 # Propositional encoding time : 0.000
% 272.23/136.63 # Propositional solver time : 0.000
% 272.23/136.63 # Success case prop preproc time : 0.000
% 272.23/136.63 # Success case prop encoding time : 0.000
% 272.23/136.63 # Success case prop solver time : 0.000
% 272.23/136.63 # Current number of processed clauses : 21
% 272.23/136.63 # Positive orientable unit clauses : 10
% 272.23/136.63 # Positive unorientable unit clauses: 5
% 272.23/136.63 # Negative unit clauses : 3
% 272.23/136.63 # Non-unit-clauses : 3
% 272.23/136.63 # Current number of unprocessed clauses: 1
% 272.23/136.63 # ...number of literals in the above : 3
% 272.23/136.63 # Current number of archived formulas : 0
% 272.23/136.63 # Current number of archived clauses : 4
% 272.23/136.63 # Clause-clause subsumption calls (NU) : 0
% 272.23/136.63 # Rec. Clause-clause subsumption calls : 0
% 272.23/136.63 # Non-unit clause-clause subsumptions : 0
% 272.23/136.63 # Unit Clause-clause subsumption calls : 6
% 272.23/136.63 # Rewrite failures with RHS unbound : 0
% 272.23/136.63 # BW rewrite match attempts : 32
% 272.23/136.63 # BW rewrite match successes : 32
% 272.23/136.63 # Condensation attempts : 0
% 272.23/136.63 # Condensation successes : 0
% 272.23/136.63 # Termbank termtop insertions : 1202
% 272.23/136.63 # Search garbage collected termcells : 202
% 272.23/136.63
% 272.23/136.63 # -------------------------------------------------
% 272.23/136.63 # User time : 0.005 s
% 272.23/136.63 # System time : 0.002 s
% 272.23/136.63 # Total time : 0.007 s
% 272.23/136.63 # Maximum resident set size: 1720 pages
% 272.23/136.63
% 272.23/136.63 # -------------------------------------------------
% 272.23/136.63 # User time : 0.008 s
% 272.23/136.63 # System time : 0.003 s
% 272.23/136.63 # Total time : 0.011 s
% 272.23/136.63 # Maximum resident set size: 1764 pages
% 272.23/136.63 % E---3.1 exiting
% 272.23/136.63 % E exiting
%------------------------------------------------------------------------------