TSTP Solution File: NUM322+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : NUM322+1 : TPTP v8.2.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n012.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 : Tue May 21 01:18:52 EDT 2024
% Result : Theorem 0.19s 0.51s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of formulae : 13 ( 9 unt; 0 def)
% Number of atoms : 20 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 15 ( 8 ~; 5 |; 1 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-1 aty)
% Number of variables : 14 ( 1 sgn 7 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(sum_entry_point_posx_negx,axiom,
! [X13,X14,X10] :
( ( rdn_translate(X13,rdn_pos(X10))
& rdn_translate(X14,rdn_neg(X10)) )
=> sum(X13,X14,n0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM005+2.ax',sum_entry_point_posx_negx) ).
fof(sum_n5_nn5_what,conjecture,
? [X1] : sum(n5,nn5,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sum_n5_nn5_what) ).
fof(rdnn5,axiom,
rdn_translate(nn5,rdn_neg(rdnn(n5))),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM005+0.ax',rdnn5) ).
fof(rdn5,axiom,
rdn_translate(n5,rdn_pos(rdnn(n5))),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM005+0.ax',rdn5) ).
fof(c_0_4,plain,
! [X58,X59,X60] :
( ~ rdn_translate(X58,rdn_pos(X60))
| ~ rdn_translate(X59,rdn_neg(X60))
| sum(X58,X59,n0) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sum_entry_point_posx_negx])])]) ).
fof(c_0_5,negated_conjecture,
~ ? [X1] : sum(n5,nn5,X1),
inference(assume_negation,[status(cth)],[sum_n5_nn5_what]) ).
cnf(c_0_6,plain,
( sum(X1,X3,n0)
| ~ rdn_translate(X1,rdn_pos(X2))
| ~ rdn_translate(X3,rdn_neg(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
rdn_translate(nn5,rdn_neg(rdnn(n5))),
inference(split_conjunct,[status(thm)],[rdnn5]) ).
fof(c_0_8,negated_conjecture,
! [X33] : ~ sum(n5,nn5,X33),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
cnf(c_0_9,plain,
( sum(X1,nn5,n0)
| ~ rdn_translate(X1,rdn_pos(rdnn(n5))) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,plain,
rdn_translate(n5,rdn_pos(rdnn(n5))),
inference(split_conjunct,[status(thm)],[rdn5]) ).
cnf(c_0_11,negated_conjecture,
~ sum(n5,nn5,X1),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : NUM322+1 : TPTP v8.2.0. Released v3.1.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n012.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon May 20 04:55:38 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.19/0.47 Running first-order model finding
% 0.19/0.47 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.51 # Version: 3.1.0
% 0.19/0.51 # Preprocessing class: FSLMSMSLSSSNFFN.
% 0.19/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.51 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.19/0.51 # Starting new_bool_3 with 600s (2) cores
% 0.19/0.51 # Starting new_bool_1 with 600s (2) cores
% 0.19/0.51 # Starting sh5l with 300s (1) cores
% 0.19/0.51 # new_bool_3 with pid 8483 completed with status 0
% 0.19/0.51 # Result found by new_bool_3
% 0.19/0.51 # Preprocessing class: FSLMSMSLSSSNFFN.
% 0.19/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.51 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.19/0.51 # Starting new_bool_3 with 600s (2) cores
% 0.19/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.51 # Search class: FHUSF-FFMM21-SFFFFFNN
% 0.19/0.51 # partial match(1): FHUNF-FFMM21-SFFFFFNN
% 0.19/0.51 # Scheduled 5 strats onto 2 cores with 600 seconds (600 total)
% 0.19/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 361s (1) cores
% 0.19/0.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 61s (1) cores
% 0.19/0.51 # SAT001_MinMin_p005000_rr_RG with pid 8488 completed with status 0
% 0.19/0.51 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.19/0.51 # Preprocessing class: FSLMSMSLSSSNFFN.
% 0.19/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.51 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.19/0.51 # Starting new_bool_3 with 600s (2) cores
% 0.19/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.51 # Search class: FHUSF-FFMM21-SFFFFFNN
% 0.19/0.51 # partial match(1): FHUNF-FFMM21-SFFFFFNN
% 0.19/0.51 # Scheduled 5 strats onto 2 cores with 600 seconds (600 total)
% 0.19/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 361s (1) cores
% 0.19/0.51 # Preprocessing time : 0.002 s
% 0.19/0.51 # Presaturation interreduction done
% 0.19/0.51
% 0.19/0.51 # Proof found!
% 0.19/0.51 # SZS status Theorem
% 0.19/0.51 # SZS output start CNFRefutation
% See solution above
% 0.19/0.51 # Parsed axioms : 402
% 0.19/0.51 # Removed by relevancy pruning/SinE : 261
% 0.19/0.51 # Initial clauses : 141
% 0.19/0.51 # Removed in clause preprocessing : 0
% 0.19/0.51 # Initial clauses in saturation : 141
% 0.19/0.51 # Processed clauses : 178
% 0.19/0.51 # ...of these trivial : 0
% 0.19/0.51 # ...subsumed : 0
% 0.19/0.51 # ...remaining for further processing : 178
% 0.19/0.51 # Other redundant clauses eliminated : 0
% 0.19/0.51 # Clauses deleted for lack of memory : 0
% 0.19/0.51 # Backward-subsumed : 0
% 0.19/0.51 # Backward-rewritten : 0
% 0.19/0.51 # Generated clauses : 12
% 0.19/0.51 # ...of the previous two non-redundant : 11
% 0.19/0.51 # ...aggressively subsumed : 0
% 0.19/0.51 # Contextual simplify-reflections : 0
% 0.19/0.51 # Paramodulations : 12
% 0.19/0.51 # Factorizations : 0
% 0.19/0.51 # NegExts : 0
% 0.19/0.51 # Equation resolutions : 0
% 0.19/0.51 # Disequality decompositions : 0
% 0.19/0.51 # Total rewrite steps : 0
% 0.19/0.51 # ...of those cached : 0
% 0.19/0.51 # Propositional unsat checks : 0
% 0.19/0.51 # Propositional check models : 0
% 0.19/0.51 # Propositional check unsatisfiable : 0
% 0.19/0.51 # Propositional clauses : 0
% 0.19/0.51 # Propositional clauses after purity: 0
% 0.19/0.51 # Propositional unsat core size : 0
% 0.19/0.51 # Propositional preprocessing time : 0.000
% 0.19/0.51 # Propositional encoding time : 0.000
% 0.19/0.51 # Propositional solver time : 0.000
% 0.19/0.51 # Success case prop preproc time : 0.000
% 0.19/0.51 # Success case prop encoding time : 0.000
% 0.19/0.51 # Success case prop solver time : 0.000
% 0.19/0.51 # Current number of processed clauses : 37
% 0.19/0.51 # Positive orientable unit clauses : 26
% 0.19/0.51 # Positive unorientable unit clauses: 0
% 0.19/0.51 # Negative unit clauses : 1
% 0.19/0.51 # Non-unit-clauses : 10
% 0.19/0.51 # Current number of unprocessed clauses: 115
% 0.19/0.51 # ...number of literals in the above : 176
% 0.19/0.51 # Current number of archived formulas : 0
% 0.19/0.51 # Current number of archived clauses : 141
% 0.19/0.51 # Clause-clause subsumption calls (NU) : 311
% 0.19/0.51 # Rec. Clause-clause subsumption calls : 66
% 0.19/0.51 # Non-unit clause-clause subsumptions : 0
% 0.19/0.51 # Unit Clause-clause subsumption calls : 8
% 0.19/0.51 # Rewrite failures with RHS unbound : 0
% 0.19/0.51 # BW rewrite match attempts : 0
% 0.19/0.51 # BW rewrite match successes : 0
% 0.19/0.51 # Condensation attempts : 0
% 0.19/0.51 # Condensation successes : 0
% 0.19/0.51 # Termbank termtop insertions : 10903
% 0.19/0.51 # Search garbage collected termcells : 1762
% 0.19/0.51
% 0.19/0.51 # -------------------------------------------------
% 0.19/0.51 # User time : 0.011 s
% 0.19/0.51 # System time : 0.007 s
% 0.19/0.51 # Total time : 0.018 s
% 0.19/0.51 # Maximum resident set size: 2844 pages
% 0.19/0.51
% 0.19/0.51 # -------------------------------------------------
% 0.19/0.51 # User time : 0.026 s
% 0.19/0.51 # System time : 0.011 s
% 0.19/0.51 # Total time : 0.038 s
% 0.19/0.51 # Maximum resident set size: 2056 pages
% 0.19/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------