TSTP Solution File: NUM027-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : NUM027-1 : TPTP v8.1.2. Bugfixed v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.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:45:49 EDT 2023
% Result : Unsatisfiable 0.15s 0.41s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 9
% Syntax : Number of clauses : 24 ( 12 unt; 4 nHn; 18 RR)
% Number of literals : 42 ( 0 equ; 23 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 30 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(transitivity_of_less,axiom,
( less(X3,X2)
| ~ less(X1,X2)
| ~ less(X3,X1) ),
file('/export/starexec/sandbox/tmp/tmp.yE2PF1kWrq/E---3.1_3782.p',transitivity_of_less) ).
cnf(b_times_c_less_than_a_times_c,hypothesis,
less(multiply(b,c),multiply(a,c)),
file('/export/starexec/sandbox/tmp/tmp.yE2PF1kWrq/E---3.1_3782.p',b_times_c_less_than_a_times_c) ).
cnf(multiply_lemma,axiom,
( equalish(X3,n0)
| less(multiply(X1,X3),multiply(X2,X3))
| ~ less(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.yE2PF1kWrq/E---3.1_3782.p',multiply_lemma) ).
cnf(prove_c_is_0,negated_conjecture,
~ equalish(c,n0),
file('/export/starexec/sandbox/tmp/tmp.yE2PF1kWrq/E---3.1_3782.p',prove_c_is_0) ).
cnf(not_less_and_equal,axiom,
( ~ less(X1,X2)
| ~ equalish(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.yE2PF1kWrq/E---3.1_3782.p',not_less_and_equal) ).
cnf(number_not_less_than_itself,axiom,
~ less(X1,X1),
file('/export/starexec/sandbox/tmp/tmp.yE2PF1kWrq/E---3.1_3782.p',number_not_less_than_itself) ).
cnf(equality_preserved_over_times,axiom,
( equalish(multiply(X1,X3),multiply(X2,X3))
| ~ equalish(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.yE2PF1kWrq/E---3.1_3782.p',equality_preserved_over_times) ).
cnf(numbers_either_less_or_equal,axiom,
( less(X1,X2)
| equalish(X2,X1)
| less(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.yE2PF1kWrq/E---3.1_3782.p',numbers_either_less_or_equal) ).
cnf(b_not_less_than_a,hypothesis,
~ less(b,a),
file('/export/starexec/sandbox/tmp/tmp.yE2PF1kWrq/E---3.1_3782.p',b_not_less_than_a) ).
cnf(c_0_9,axiom,
( less(X3,X2)
| ~ less(X1,X2)
| ~ less(X3,X1) ),
transitivity_of_less ).
cnf(c_0_10,hypothesis,
less(multiply(b,c),multiply(a,c)),
b_times_c_less_than_a_times_c ).
cnf(c_0_11,hypothesis,
( less(multiply(b,c),X1)
| ~ less(multiply(a,c),X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,axiom,
( equalish(X3,n0)
| less(multiply(X1,X3),multiply(X2,X3))
| ~ less(X1,X2) ),
multiply_lemma ).
cnf(c_0_13,negated_conjecture,
~ equalish(c,n0),
prove_c_is_0 ).
cnf(c_0_14,axiom,
( ~ less(X1,X2)
| ~ equalish(X1,X2) ),
not_less_and_equal ).
cnf(c_0_15,axiom,
~ less(X1,X1),
number_not_less_than_itself ).
cnf(c_0_16,hypothesis,
( less(multiply(b,c),multiply(X1,c))
| ~ less(a,X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).
cnf(c_0_17,hypothesis,
~ equalish(multiply(b,c),multiply(a,c)),
inference(spm,[status(thm)],[c_0_14,c_0_10]) ).
cnf(c_0_18,axiom,
( equalish(multiply(X1,X3),multiply(X2,X3))
| ~ equalish(X1,X2) ),
equality_preserved_over_times ).
cnf(c_0_19,hypothesis,
~ less(a,b),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,axiom,
( less(X1,X2)
| equalish(X2,X1)
| less(X2,X1) ),
numbers_either_less_or_equal ).
cnf(c_0_21,hypothesis,
~ less(b,a),
b_not_less_than_a ).
cnf(c_0_22,hypothesis,
~ equalish(b,a),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,hypothesis,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_22]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : NUM027-1 : TPTP v8.1.2. Bugfixed v4.0.0.
% 0.00/0.10 % Command : run_E %s %d THM
% 0.09/0.30 % Computer : n009.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 2400
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Mon Oct 2 14:02:59 EDT 2023
% 0.09/0.30 % CPUTime :
% 0.15/0.40 Running first-order theorem proving
% 0.15/0.40 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.yE2PF1kWrq/E---3.1_3782.p
% 0.15/0.41 # Version: 3.1pre001
% 0.15/0.41 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.41 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.41 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.41 # Starting sh5l with 300s (1) cores
% 0.15/0.41 # new_bool_1 with pid 3862 completed with status 0
% 0.15/0.41 # Result found by new_bool_1
% 0.15/0.41 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.41 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.41 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.41 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.41 # Search class: FGHNM-FFSF21-SFFFFFNN
% 0.15/0.41 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.41 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.15/0.41 # SAT001_MinMin_p005000_rr_RG with pid 3867 completed with status 0
% 0.15/0.41 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.15/0.41 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.41 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.41 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.41 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.41 # Search class: FGHNM-FFSF21-SFFFFFNN
% 0.15/0.41 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.41 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.15/0.41 # Preprocessing time : 0.001 s
% 0.15/0.41 # Presaturation interreduction done
% 0.15/0.41
% 0.15/0.41 # Proof found!
% 0.15/0.41 # SZS status Unsatisfiable
% 0.15/0.41 # SZS output start CNFRefutation
% See solution above
% 0.15/0.41 # Parsed axioms : 21
% 0.15/0.41 # Removed by relevancy pruning/SinE : 1
% 0.15/0.41 # Initial clauses : 20
% 0.15/0.41 # Removed in clause preprocessing : 0
% 0.15/0.41 # Initial clauses in saturation : 20
% 0.15/0.41 # Processed clauses : 75
% 0.15/0.41 # ...of these trivial : 0
% 0.15/0.41 # ...subsumed : 4
% 0.15/0.41 # ...remaining for further processing : 71
% 0.15/0.41 # Other redundant clauses eliminated : 0
% 0.15/0.41 # Clauses deleted for lack of memory : 0
% 0.15/0.41 # Backward-subsumed : 0
% 0.15/0.41 # Backward-rewritten : 0
% 0.15/0.41 # Generated clauses : 118
% 0.15/0.41 # ...of the previous two non-redundant : 85
% 0.15/0.41 # ...aggressively subsumed : 0
% 0.15/0.41 # Contextual simplify-reflections : 0
% 0.15/0.41 # Paramodulations : 116
% 0.15/0.41 # Factorizations : 2
% 0.15/0.41 # NegExts : 0
% 0.15/0.41 # Equation resolutions : 0
% 0.15/0.41 # Total rewrite steps : 29
% 0.15/0.41 # Propositional unsat checks : 0
% 0.15/0.41 # Propositional check models : 0
% 0.15/0.41 # Propositional check unsatisfiable : 0
% 0.15/0.41 # Propositional clauses : 0
% 0.15/0.41 # Propositional clauses after purity: 0
% 0.15/0.41 # Propositional unsat core size : 0
% 0.15/0.41 # Propositional preprocessing time : 0.000
% 0.15/0.41 # Propositional encoding time : 0.000
% 0.15/0.41 # Propositional solver time : 0.000
% 0.15/0.41 # Success case prop preproc time : 0.000
% 0.15/0.41 # Success case prop encoding time : 0.000
% 0.15/0.41 # Success case prop solver time : 0.000
% 0.15/0.41 # Current number of processed clauses : 51
% 0.15/0.41 # Positive orientable unit clauses : 20
% 0.15/0.41 # Positive unorientable unit clauses: 0
% 0.15/0.41 # Negative unit clauses : 9
% 0.15/0.41 # Non-unit-clauses : 22
% 0.15/0.41 # Current number of unprocessed clauses: 49
% 0.15/0.41 # ...number of literals in the above : 98
% 0.15/0.41 # Current number of archived formulas : 0
% 0.15/0.41 # Current number of archived clauses : 20
% 0.15/0.41 # Clause-clause subsumption calls (NU) : 49
% 0.15/0.41 # Rec. Clause-clause subsumption calls : 47
% 0.15/0.41 # Non-unit clause-clause subsumptions : 2
% 0.15/0.41 # Unit Clause-clause subsumption calls : 37
% 0.15/0.41 # Rewrite failures with RHS unbound : 0
% 0.15/0.41 # BW rewrite match attempts : 7
% 0.15/0.41 # BW rewrite match successes : 0
% 0.15/0.41 # Condensation attempts : 0
% 0.15/0.41 # Condensation successes : 0
% 0.15/0.41 # Termbank termtop insertions : 1744
% 0.15/0.41
% 0.15/0.41 # -------------------------------------------------
% 0.15/0.41 # User time : 0.002 s
% 0.15/0.41 # System time : 0.004 s
% 0.15/0.41 # Total time : 0.006 s
% 0.15/0.41 # Maximum resident set size: 1620 pages
% 0.15/0.41
% 0.15/0.41 # -------------------------------------------------
% 0.15/0.41 # User time : 0.003 s
% 0.15/0.41 # System time : 0.005 s
% 0.15/0.41 # Total time : 0.008 s
% 0.15/0.41 # Maximum resident set size: 1688 pages
% 0.15/0.41 % E---3.1 exiting
% 0.15/0.42 % E---3.1 exiting
%------------------------------------------------------------------------------