TSTP Solution File: NUM015-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : NUM015-1 : TPTP v8.2.0. Released v1.0.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:07 EDT 2024
% Result : Unsatisfiable 0.22s 0.50s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 25 ( 4 unt; 8 nHn; 17 RR)
% Number of literals : 58 ( 0 equ; 29 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-1 aty)
% Number of variables : 30 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(transitive_divide,axiom,
( divides(X1,X3)
| ~ divides(X1,X2)
| ~ divides(X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitive_divide) ).
cnf(prove_a_has_prime_divisor,negated_conjecture,
( ~ prime(X1)
| ~ divides(X1,a) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_a_has_prime_divisor) ).
cnf(factor1,axiom,
( prime(factor_of(X1))
| ~ less(n1,X1)
| ~ less(X1,a) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',factor1) ).
cnf(prime,axiom,
( prime(X1)
| divides(divisor(X1),X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prime) ).
cnf(factor2,axiom,
( divides(factor_of(X1),X1)
| ~ less(n1,X1)
| ~ less(X1,a) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',factor2) ).
cnf(divisor1,axiom,
( prime(X1)
| less(n1,divisor(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',divisor1) ).
cnf(divisor2,axiom,
( prime(X1)
| less(divisor(X1),X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',divisor2) ).
cnf(divide_self,axiom,
divides(X1,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',divide_self) ).
cnf(c_0_8,plain,
( divides(X1,X3)
| ~ divides(X1,X2)
| ~ divides(X2,X3) ),
inference(fof_simplification,[status(thm)],[transitive_divide]) ).
cnf(c_0_9,negated_conjecture,
( ~ prime(X1)
| ~ divides(X1,a) ),
inference(fof_simplification,[status(thm)],[prove_a_has_prime_divisor]) ).
cnf(c_0_10,plain,
( prime(factor_of(X1))
| ~ less(n1,X1)
| ~ less(X1,a) ),
inference(fof_simplification,[status(thm)],[factor1]) ).
cnf(c_0_11,plain,
( divides(X1,X3)
| ~ divides(X1,X2)
| ~ divides(X2,X3) ),
c_0_8 ).
cnf(c_0_12,axiom,
( prime(X1)
| divides(divisor(X1),X1) ),
prime ).
cnf(c_0_13,plain,
( divides(factor_of(X1),X1)
| ~ less(n1,X1)
| ~ less(X1,a) ),
inference(fof_simplification,[status(thm)],[factor2]) ).
cnf(c_0_14,negated_conjecture,
( ~ prime(X1)
| ~ divides(X1,a) ),
c_0_9 ).
cnf(c_0_15,plain,
( prime(factor_of(X1))
| ~ less(n1,X1)
| ~ less(X1,a) ),
c_0_10 ).
cnf(c_0_16,plain,
( prime(X1)
| divides(X2,X1)
| ~ divides(X2,divisor(X1)) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,plain,
( divides(factor_of(X1),X1)
| ~ less(n1,X1)
| ~ less(X1,a) ),
c_0_13 ).
cnf(c_0_18,axiom,
( prime(X1)
| less(n1,divisor(X1)) ),
divisor1 ).
cnf(c_0_19,negated_conjecture,
( ~ less(X1,a)
| ~ less(n1,X1)
| ~ divides(factor_of(X1),a) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
( prime(X1)
| divides(factor_of(divisor(X1)),X1)
| ~ less(divisor(X1),a) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
cnf(c_0_21,axiom,
( prime(X1)
| less(divisor(X1),X1) ),
divisor2 ).
cnf(c_0_22,negated_conjecture,
prime(a),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_18]),c_0_21]) ).
cnf(c_0_23,axiom,
divides(X1,X1),
divide_self ).
cnf(c_0_24,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_22]),c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : NUM015-1 : TPTP v8.2.0. Released v1.0.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n012.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon May 20 05:37:08 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.22/0.49 Running first-order model finding
% 0.22/0.49 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.22/0.50 # Version: 3.1.0
% 0.22/0.50 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.22/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.22/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.50 # Starting sh5l with 300s (1) cores
% 0.22/0.50 # sh5l with pid 21241 completed with status 0
% 0.22/0.50 # Result found by sh5l
% 0.22/0.50 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.22/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.22/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.50 # Starting sh5l with 300s (1) cores
% 0.22/0.50 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.22/0.50 # Search class: FGHNF-FFSF11-SFFFFFNN
% 0.22/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.22/0.50 # SAT001_MinMin_p005000_rr_RG with pid 21248 completed with status 0
% 0.22/0.50 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.22/0.50 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.22/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.22/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.50 # Starting sh5l with 300s (1) cores
% 0.22/0.50 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.22/0.50 # Search class: FGHNF-FFSF11-SFFFFFNN
% 0.22/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.22/0.50 # Preprocessing time : 0.001 s
% 0.22/0.50 # Presaturation interreduction done
% 0.22/0.50
% 0.22/0.50 # Proof found!
% 0.22/0.50 # SZS status Unsatisfiable
% 0.22/0.50 # SZS output start CNFRefutation
% See solution above
% 0.22/0.50 # Parsed axioms : 9
% 0.22/0.50 # Removed by relevancy pruning/SinE : 0
% 0.22/0.50 # Initial clauses : 9
% 0.22/0.50 # Removed in clause preprocessing : 0
% 0.22/0.50 # Initial clauses in saturation : 9
% 0.22/0.50 # Processed clauses : 29
% 0.22/0.50 # ...of these trivial : 0
% 0.22/0.50 # ...subsumed : 3
% 0.22/0.50 # ...remaining for further processing : 26
% 0.22/0.50 # Other redundant clauses eliminated : 0
% 0.22/0.50 # Clauses deleted for lack of memory : 0
% 0.22/0.50 # Backward-subsumed : 0
% 0.22/0.50 # Backward-rewritten : 0
% 0.22/0.51 # Generated clauses : 24
% 0.22/0.51 # ...of the previous two non-redundant : 22
% 0.22/0.51 # ...aggressively subsumed : 0
% 0.22/0.51 # Contextual simplify-reflections : 3
% 0.22/0.51 # Paramodulations : 24
% 0.22/0.51 # Factorizations : 0
% 0.22/0.51 # NegExts : 0
% 0.22/0.51 # Equation resolutions : 0
% 0.22/0.51 # Disequality decompositions : 0
% 0.22/0.51 # Total rewrite steps : 2
% 0.22/0.51 # ...of those cached : 0
% 0.22/0.51 # Propositional unsat checks : 0
% 0.22/0.51 # Propositional check models : 0
% 0.22/0.51 # Propositional check unsatisfiable : 0
% 0.22/0.51 # Propositional clauses : 0
% 0.22/0.51 # Propositional clauses after purity: 0
% 0.22/0.51 # Propositional unsat core size : 0
% 0.22/0.51 # Propositional preprocessing time : 0.000
% 0.22/0.51 # Propositional encoding time : 0.000
% 0.22/0.51 # Propositional solver time : 0.000
% 0.22/0.51 # Success case prop preproc time : 0.000
% 0.22/0.51 # Success case prop encoding time : 0.000
% 0.22/0.51 # Success case prop solver time : 0.000
% 0.22/0.51 # Current number of processed clauses : 17
% 0.22/0.51 # Positive orientable unit clauses : 3
% 0.22/0.51 # Positive unorientable unit clauses: 0
% 0.22/0.51 # Negative unit clauses : 1
% 0.22/0.51 # Non-unit-clauses : 13
% 0.22/0.51 # Current number of unprocessed clauses: 11
% 0.22/0.51 # ...number of literals in the above : 50
% 0.22/0.51 # Current number of archived formulas : 0
% 0.22/0.51 # Current number of archived clauses : 9
% 0.22/0.51 # Clause-clause subsumption calls (NU) : 29
% 0.22/0.51 # Rec. Clause-clause subsumption calls : 19
% 0.22/0.51 # Non-unit clause-clause subsumptions : 6
% 0.22/0.51 # Unit Clause-clause subsumption calls : 1
% 0.22/0.51 # Rewrite failures with RHS unbound : 0
% 0.22/0.51 # BW rewrite match attempts : 2
% 0.22/0.51 # BW rewrite match successes : 0
% 0.22/0.51 # Condensation attempts : 0
% 0.22/0.51 # Condensation successes : 0
% 0.22/0.51 # Termbank termtop insertions : 696
% 0.22/0.51 # Search garbage collected termcells : 18
% 0.22/0.51
% 0.22/0.51 # -------------------------------------------------
% 0.22/0.51 # User time : 0.004 s
% 0.22/0.51 # System time : 0.002 s
% 0.22/0.51 # Total time : 0.005 s
% 0.22/0.51 # Maximum resident set size: 1592 pages
% 0.22/0.51
% 0.22/0.51 # -------------------------------------------------
% 0.22/0.51 # User time : 0.005 s
% 0.22/0.51 # System time : 0.004 s
% 0.22/0.51 # Total time : 0.009 s
% 0.22/0.51 # Maximum resident set size: 1688 pages
% 0.22/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------