TSTP Solution File: NUM021-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : NUM021-1 : TPTP v8.2.0. Bugfixed v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n018.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:08 EDT 2024
% Result : Unsatisfiable 0.20s 0.49s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of clauses : 29 ( 9 unt; 4 nHn; 29 RR)
% Number of literals : 58 ( 0 equ; 28 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 44 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(transitivity_of_less,axiom,
( less(X3,X2)
| ~ less(X1,X2)
| ~ less(X3,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM001-1.ax',transitivity_of_less) ).
cnf(divides_only_less_or_equal,axiom,
( less(X1,X2)
| equalish(X1,X2)
| ~ divides(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM001-2.ax',divides_only_less_or_equal) ).
cnf(b_less_than_c,hypothesis,
less(b,c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_less_than_c) ).
cnf(impossible_c_divides_a,negated_conjecture,
divides(c,a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',impossible_c_divides_a) ).
cnf(b_greater_equal_a,hypothesis,
~ less(b,a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_greater_equal_a) ).
cnf(transitivity,axiom,
( equalish(X1,X3)
| ~ equalish(X1,X2)
| ~ equalish(X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitivity) ).
cnf(smaller_number,axiom,
( less(X2,X3)
| ~ equalish(add(successor(X1),X2),X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM001-1.ax',smaller_number) ).
cnf(less_lemma,axiom,
( equalish(add(successor(predecessor_of_1st_minus_2nd(X2,X1)),X1),X2)
| ~ less(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM001-1.ax',less_lemma) ).
cnf(c_0_8,plain,
( less(X3,X2)
| ~ less(X1,X2)
| ~ less(X3,X1) ),
inference(fof_simplification,[status(thm)],[transitivity_of_less]) ).
cnf(c_0_9,plain,
( less(X1,X2)
| equalish(X1,X2)
| ~ divides(X1,X2) ),
inference(fof_simplification,[status(thm)],[divides_only_less_or_equal]) ).
cnf(c_0_10,plain,
( less(X3,X2)
| ~ less(X1,X2)
| ~ less(X3,X1) ),
c_0_8 ).
cnf(c_0_11,hypothesis,
less(b,c),
b_less_than_c ).
cnf(c_0_12,plain,
( less(X1,X2)
| equalish(X1,X2)
| ~ divides(X1,X2) ),
c_0_9 ).
cnf(c_0_13,negated_conjecture,
divides(c,a),
impossible_c_divides_a ).
cnf(c_0_14,hypothesis,
~ less(b,a),
inference(fof_simplification,[status(thm)],[b_greater_equal_a]) ).
cnf(c_0_15,plain,
( equalish(X1,X3)
| ~ equalish(X1,X2)
| ~ equalish(X2,X3) ),
inference(fof_simplification,[status(thm)],[transitivity]) ).
cnf(c_0_16,hypothesis,
( less(b,X1)
| ~ less(c,X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_17,negated_conjecture,
( less(c,a)
| equalish(c,a) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,hypothesis,
~ less(b,a),
c_0_14 ).
cnf(c_0_19,plain,
( less(X2,X3)
| ~ equalish(add(successor(X1),X2),X3) ),
inference(fof_simplification,[status(thm)],[smaller_number]) ).
cnf(c_0_20,plain,
( equalish(X1,X3)
| ~ equalish(X1,X2)
| ~ equalish(X2,X3) ),
c_0_15 ).
cnf(c_0_21,negated_conjecture,
equalish(c,a),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
cnf(c_0_22,plain,
( less(X2,X3)
| ~ equalish(add(successor(X1),X2),X3) ),
c_0_19 ).
cnf(c_0_23,negated_conjecture,
( equalish(X1,a)
| ~ equalish(X1,c) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,plain,
( equalish(add(successor(predecessor_of_1st_minus_2nd(X2,X1)),X1),X2)
| ~ less(X1,X2) ),
inference(fof_simplification,[status(thm)],[less_lemma]) ).
cnf(c_0_25,negated_conjecture,
( less(X1,a)
| ~ equalish(add(successor(X2),X1),c) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,plain,
( equalish(add(successor(predecessor_of_1st_minus_2nd(X2,X1)),X1),X2)
| ~ less(X1,X2) ),
c_0_24 ).
cnf(c_0_27,negated_conjecture,
( less(X1,a)
| ~ less(X1,c) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_28,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_27]),c_0_11])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM021-1 : TPTP v8.2.0. Bugfixed v4.0.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n018.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon May 20 04:38:23 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order model finding
% 0.20/0.48 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.20/0.49 # Version: 3.1.0
% 0.20/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.49 # Starting sh5l with 300s (1) cores
% 0.20/0.49 # sh5l with pid 2445 completed with status 0
% 0.20/0.49 # Result found by sh5l
% 0.20/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.49 # Starting sh5l with 300s (1) cores
% 0.20/0.49 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.49 # Search class: FGUNM-FFSF21-MFFFFFNN
% 0.20/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.49 # SAT001_MinMin_p005000_rr_RG with pid 2452 completed with status 0
% 0.20/0.49 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.49 # Starting sh5l with 300s (1) cores
% 0.20/0.49 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.49 # Search class: FGUNM-FFSF21-MFFFFFNN
% 0.20/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.49 # Preprocessing time : 0.001 s
% 0.20/0.49 # Presaturation interreduction done
% 0.20/0.49
% 0.20/0.49 # Proof found!
% 0.20/0.49 # SZS status Unsatisfiable
% 0.20/0.49 # SZS output start CNFRefutation
% See solution above
% 0.20/0.49 # Parsed axioms : 19
% 0.20/0.49 # Removed by relevancy pruning/SinE : 0
% 0.20/0.49 # Initial clauses : 19
% 0.20/0.49 # Removed in clause preprocessing : 0
% 0.20/0.49 # Initial clauses in saturation : 19
% 0.20/0.49 # Processed clauses : 64
% 0.20/0.49 # ...of these trivial : 0
% 0.20/0.49 # ...subsumed : 2
% 0.20/0.49 # ...remaining for further processing : 62
% 0.20/0.49 # Other redundant clauses eliminated : 0
% 0.20/0.49 # Clauses deleted for lack of memory : 0
% 0.20/0.49 # Backward-subsumed : 1
% 0.20/0.49 # Backward-rewritten : 1
% 0.20/0.49 # Generated clauses : 99
% 0.20/0.49 # ...of the previous two non-redundant : 62
% 0.20/0.49 # ...aggressively subsumed : 0
% 0.20/0.49 # Contextual simplify-reflections : 0
% 0.20/0.49 # Paramodulations : 99
% 0.20/0.49 # Factorizations : 0
% 0.20/0.49 # NegExts : 0
% 0.20/0.49 # Equation resolutions : 0
% 0.20/0.49 # Disequality decompositions : 0
% 0.20/0.49 # Total rewrite steps : 30
% 0.20/0.49 # ...of those cached : 15
% 0.20/0.49 # Propositional unsat checks : 0
% 0.20/0.49 # Propositional check models : 0
% 0.20/0.49 # Propositional check unsatisfiable : 0
% 0.20/0.49 # Propositional clauses : 0
% 0.20/0.49 # Propositional clauses after purity: 0
% 0.20/0.49 # Propositional unsat core size : 0
% 0.20/0.49 # Propositional preprocessing time : 0.000
% 0.20/0.49 # Propositional encoding time : 0.000
% 0.20/0.49 # Propositional solver time : 0.000
% 0.20/0.49 # Success case prop preproc time : 0.000
% 0.20/0.49 # Success case prop encoding time : 0.000
% 0.20/0.49 # Success case prop solver time : 0.000
% 0.20/0.49 # Current number of processed clauses : 41
% 0.20/0.49 # Positive orientable unit clauses : 18
% 0.20/0.49 # Positive unorientable unit clauses: 0
% 0.20/0.49 # Negative unit clauses : 2
% 0.20/0.49 # Non-unit-clauses : 21
% 0.20/0.49 # Current number of unprocessed clauses: 35
% 0.20/0.49 # ...number of literals in the above : 62
% 0.20/0.49 # Current number of archived formulas : 0
% 0.20/0.49 # Current number of archived clauses : 21
% 0.20/0.49 # Clause-clause subsumption calls (NU) : 99
% 0.20/0.49 # Rec. Clause-clause subsumption calls : 74
% 0.20/0.49 # Non-unit clause-clause subsumptions : 3
% 0.20/0.49 # Unit Clause-clause subsumption calls : 0
% 0.20/0.49 # Rewrite failures with RHS unbound : 0
% 0.20/0.49 # BW rewrite match attempts : 3
% 0.20/0.49 # BW rewrite match successes : 1
% 0.20/0.49 # Condensation attempts : 0
% 0.20/0.49 # Condensation successes : 0
% 0.20/0.49 # Termbank termtop insertions : 1464
% 0.20/0.49 # Search garbage collected termcells : 26
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.006 s
% 0.20/0.49 # System time : 0.000 s
% 0.20/0.49 # Total time : 0.006 s
% 0.20/0.49 # Maximum resident set size: 1604 pages
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.009 s
% 0.20/0.49 # System time : 0.001 s
% 0.20/0.49 # Total time : 0.010 s
% 0.20/0.49 # Maximum resident set size: 1708 pages
% 0.20/0.49 % E---3.1 exiting
%------------------------------------------------------------------------------