TSTP Solution File: NUM844+2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : NUM844+2 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n010.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 18:57:45 EDT 2023
% Result : Theorem 0.17s 0.44s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of formulae : 16 ( 14 unt; 0 def)
% Number of atoms : 18 ( 17 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 5 ( 3 ~; 0 |; 2 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 25 ( 0 sgn; 14 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof('holds(266, 415, 3)',conjecture,
vplus(vmul(vd411,vd413),vplus(vd413,vsucc(vd411))) = vplus(vmul(vd411,vd413),vplus(vsucc(vd411),vd413)),
file('/export/starexec/sandbox/tmp/tmp.6cQzKoMRaP/E---3.1_18683.p','holds(266, 415, 3)') ).
fof('qu(cond(conseq(axiom(3)), 3), and(holds(definiens(29), 45, 0), holds(definiens(29), 44, 0)))',axiom,
! [X16,X17] :
( vplus(X16,vsucc(X17)) = vsucc(vplus(X16,X17))
& vplus(X16,v1) = vsucc(X16) ),
file('/export/starexec/sandbox/tmp/tmp.6cQzKoMRaP/E---3.1_18683.p','qu(cond(conseq(axiom(3)), 3), and(holds(definiens(29), 45, 0), holds(definiens(29), 44, 0)))') ).
fof('ass(cond(61, 0), 0)',axiom,
! [X8,X9] : vplus(X9,X8) = vplus(X8,X9),
file('/export/starexec/sandbox/tmp/tmp.6cQzKoMRaP/E---3.1_18683.p','ass(cond(61, 0), 0)') ).
fof('ass(cond(33, 0), 0)',axiom,
! [X13,X14,X15] : vplus(vplus(X13,X14),X15) = vplus(X13,vplus(X14,X15)),
file('/export/starexec/sandbox/tmp/tmp.6cQzKoMRaP/E---3.1_18683.p','ass(cond(33, 0), 0)') ).
fof(c_0_4,negated_conjecture,
vplus(vmul(vd411,vd413),vplus(vd413,vsucc(vd411))) != vplus(vmul(vd411,vd413),vplus(vsucc(vd411),vd413)),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],['holds(266, 415, 3)'])]) ).
fof(c_0_5,plain,
! [X37,X38] :
( vplus(X37,vsucc(X38)) = vsucc(vplus(X37,X38))
& vplus(X37,v1) = vsucc(X37) ),
inference(variable_rename,[status(thm)],['qu(cond(conseq(axiom(3)), 3), and(holds(definiens(29), 45, 0), holds(definiens(29), 44, 0)))']) ).
fof(c_0_6,plain,
! [X29,X30] : vplus(X30,X29) = vplus(X29,X30),
inference(variable_rename,[status(thm)],['ass(cond(61, 0), 0)']) ).
fof(c_0_7,plain,
! [X34,X35,X36] : vplus(vplus(X34,X35),X36) = vplus(X34,vplus(X35,X36)),
inference(variable_rename,[status(thm)],['ass(cond(33, 0), 0)']) ).
cnf(c_0_8,negated_conjecture,
vplus(vmul(vd411,vd413),vplus(vd413,vsucc(vd411))) != vplus(vmul(vd411,vd413),vplus(vsucc(vd411),vd413)),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_9,plain,
vplus(X1,v1) = vsucc(X1),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,plain,
vplus(X1,X2) = vplus(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
vplus(vplus(X1,X2),X3) = vplus(X1,vplus(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,negated_conjecture,
vplus(vmul(vd411,vd413),vplus(vd413,vplus(vd411,v1))) != vplus(vmul(vd411,vd413),vplus(vplus(vd411,v1),vd413)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9]),c_0_9]) ).
cnf(c_0_13,plain,
vplus(X1,X2) = vplus(X2,X1),
c_0_10 ).
cnf(c_0_14,plain,
vplus(vplus(X1,X2),X3) = vplus(X1,vplus(X2,X3)),
c_0_11 ).
cnf(c_0_15,negated_conjecture,
$false,
inference(ar,[status(thm)],[c_0_12,c_0_13,c_0_14]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : NUM844+2 : TPTP v8.1.2. Released v4.1.0.
% 0.10/0.13 % Command : run_E %s %d THM
% 0.12/0.32 % Computer : n010.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 2400
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Mon Oct 2 13:08:50 EDT 2023
% 0.12/0.32 % CPUTime :
% 0.17/0.43 Running first-order theorem proving
% 0.17/0.43 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.6cQzKoMRaP/E---3.1_18683.p
% 0.17/0.44 # Version: 3.1pre001
% 0.17/0.44 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.44 # Starting sh5l with 300s (1) cores
% 0.17/0.44 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 18761 completed with status 0
% 0.17/0.44 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.17/0.44 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.44 # No SInE strategy applied
% 0.17/0.44 # Search class: FGUSM-FFMM21-MFFFFFNN
% 0.17/0.44 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.44 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.17/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.17/0.44 # Starting new_bool_3 with 136s (1) cores
% 0.17/0.44 # Starting new_bool_1 with 136s (1) cores
% 0.17/0.44 # Starting sh5l with 136s (1) cores
% 0.17/0.44 # SAT001_MinMin_p005000_rr_RG with pid 18767 completed with status 0
% 0.17/0.44 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.17/0.44 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.44 # No SInE strategy applied
% 0.17/0.44 # Search class: FGUSM-FFMM21-MFFFFFNN
% 0.17/0.44 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.44 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.17/0.44 # Preprocessing time : 0.001 s
% 0.17/0.44 # Presaturation interreduction done
% 0.17/0.44
% 0.17/0.44 # Proof found!
% 0.17/0.44 # SZS status Theorem
% 0.17/0.44 # SZS output start CNFRefutation
% See solution above
% 0.17/0.44 # Parsed axioms : 20
% 0.17/0.44 # Removed by relevancy pruning/SinE : 0
% 0.17/0.44 # Initial clauses : 22
% 0.17/0.44 # Removed in clause preprocessing : 2
% 0.17/0.44 # Initial clauses in saturation : 20
% 0.17/0.44 # Processed clauses : 5
% 0.17/0.44 # ...of these trivial : 2
% 0.17/0.44 # ...subsumed : 0
% 0.17/0.44 # ...remaining for further processing : 2
% 0.17/0.44 # Other redundant clauses eliminated : 0
% 0.17/0.44 # Clauses deleted for lack of memory : 0
% 0.17/0.44 # Backward-subsumed : 0
% 0.17/0.44 # Backward-rewritten : 0
% 0.17/0.44 # Generated clauses : 0
% 0.17/0.44 # ...of the previous two non-redundant : 0
% 0.17/0.44 # ...aggressively subsumed : 0
% 0.17/0.44 # Contextual simplify-reflections : 0
% 0.17/0.44 # Paramodulations : 0
% 0.17/0.44 # Factorizations : 0
% 0.17/0.44 # NegExts : 0
% 0.17/0.44 # Equation resolutions : 0
% 0.17/0.44 # Total rewrite steps : 2
% 0.17/0.44 # Propositional unsat checks : 0
% 0.17/0.44 # Propositional check models : 0
% 0.17/0.44 # Propositional check unsatisfiable : 0
% 0.17/0.44 # Propositional clauses : 0
% 0.17/0.44 # Propositional clauses after purity: 0
% 0.17/0.44 # Propositional unsat core size : 0
% 0.17/0.44 # Propositional preprocessing time : 0.000
% 0.17/0.44 # Propositional encoding time : 0.000
% 0.17/0.44 # Propositional solver time : 0.000
% 0.17/0.44 # Success case prop preproc time : 0.000
% 0.17/0.44 # Success case prop encoding time : 0.000
% 0.17/0.44 # Success case prop solver time : 0.000
% 0.17/0.44 # Current number of processed clauses : 2
% 0.17/0.44 # Positive orientable unit clauses : 2
% 0.17/0.44 # Positive unorientable unit clauses: 0
% 0.17/0.44 # Negative unit clauses : 0
% 0.17/0.44 # Non-unit-clauses : 0
% 0.17/0.44 # Current number of unprocessed clauses: 15
% 0.17/0.44 # ...number of literals in the above : 19
% 0.17/0.44 # Current number of archived formulas : 0
% 0.17/0.44 # Current number of archived clauses : 1
% 0.17/0.44 # Clause-clause subsumption calls (NU) : 0
% 0.17/0.44 # Rec. Clause-clause subsumption calls : 0
% 0.17/0.44 # Non-unit clause-clause subsumptions : 0
% 0.17/0.44 # Unit Clause-clause subsumption calls : 0
% 0.17/0.44 # Rewrite failures with RHS unbound : 0
% 0.17/0.44 # BW rewrite match attempts : 0
% 0.17/0.44 # BW rewrite match successes : 0
% 0.17/0.44 # Condensation attempts : 0
% 0.17/0.44 # Condensation successes : 0
% 0.17/0.44 # Termbank termtop insertions : 865
% 0.17/0.44
% 0.17/0.44 # -------------------------------------------------
% 0.17/0.44 # User time : 0.003 s
% 0.17/0.44 # System time : 0.001 s
% 0.17/0.44 # Total time : 0.004 s
% 0.17/0.44 # Maximum resident set size: 1776 pages
% 0.17/0.44
% 0.17/0.44 # -------------------------------------------------
% 0.17/0.44 # User time : 0.008 s
% 0.17/0.44 # System time : 0.005 s
% 0.17/0.44 # Total time : 0.012 s
% 0.17/0.44 # Maximum resident set size: 1704 pages
% 0.17/0.44 % E---3.1 exiting
% 0.17/0.44 % E---3.1 exiting
%------------------------------------------------------------------------------