TSTP Solution File: NUM016-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : NUM016-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n025.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:46 EDT 2023
% Result : Unsatisfiable 0.21s 0.49s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 22 ( 7 unt; 7 nHn; 13 RR)
% Number of literals : 40 ( 0 equ; 19 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 22 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(numbers_are_different,axiom,
( ~ less(X1,X2)
| ~ less(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.ZoS8AZVLt3/E---3.1_21567.p',numbers_are_different) ).
cnf(prove_there_is_another_prime,negated_conjecture,
( less(factorial_plus_one(a),X1)
| ~ prime(X1)
| ~ less(a,X1) ),
file('/export/starexec/sandbox/tmp/tmp.ZoS8AZVLt3/E---3.1_21567.p',prove_there_is_another_prime) ).
cnf(nothing_is_less_than_itself,axiom,
~ less(X1,X1),
file('/export/starexec/sandbox/tmp/tmp.ZoS8AZVLt3/E---3.1_21567.p',nothing_is_less_than_itself) ).
cnf(a_prime_is_less_than_the_next_one,axiom,
less(X1,factorial_plus_one(X1)),
file('/export/starexec/sandbox/tmp/tmp.ZoS8AZVLt3/E---3.1_21567.p',a_prime_is_less_than_the_next_one) ).
cnf(smaller_prime_divisors,axiom,
( prime(X1)
| less(prime_divisor(X1),X1) ),
file('/export/starexec/sandbox/tmp/tmp.ZoS8AZVLt3/E---3.1_21567.p',smaller_prime_divisors) ).
cnf(prime_divsiors,axiom,
( prime(X1)
| prime(prime_divisor(X1)) ),
file('/export/starexec/sandbox/tmp/tmp.ZoS8AZVLt3/E---3.1_21567.p',prime_divsiors) ).
cnf(divisor_is_smaller,axiom,
( less(X2,X1)
| ~ divides(X1,factorial_plus_one(X2)) ),
file('/export/starexec/sandbox/tmp/tmp.ZoS8AZVLt3/E---3.1_21567.p',divisor_is_smaller) ).
cnf(division_by_prime_divisor,axiom,
( prime(X1)
| divides(prime_divisor(X1),X1) ),
file('/export/starexec/sandbox/tmp/tmp.ZoS8AZVLt3/E---3.1_21567.p',division_by_prime_divisor) ).
cnf(c_0_8,axiom,
( ~ less(X1,X2)
| ~ less(X2,X1) ),
numbers_are_different ).
cnf(c_0_9,negated_conjecture,
( less(factorial_plus_one(a),X1)
| ~ prime(X1)
| ~ less(a,X1) ),
prove_there_is_another_prime ).
cnf(c_0_10,axiom,
~ less(X1,X1),
nothing_is_less_than_itself ).
cnf(c_0_11,axiom,
less(X1,factorial_plus_one(X1)),
a_prime_is_less_than_the_next_one ).
cnf(c_0_12,negated_conjecture,
( ~ prime(X1)
| ~ less(X1,factorial_plus_one(a))
| ~ less(a,X1) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,axiom,
( prime(X1)
| less(prime_divisor(X1),X1) ),
smaller_prime_divisors ).
cnf(c_0_14,negated_conjecture,
~ prime(factorial_plus_one(a)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_9]),c_0_11])]) ).
cnf(c_0_15,negated_conjecture,
( ~ prime(prime_divisor(factorial_plus_one(a)))
| ~ less(a,prime_divisor(factorial_plus_one(a))) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
cnf(c_0_16,axiom,
( prime(X1)
| prime(prime_divisor(X1)) ),
prime_divsiors ).
cnf(c_0_17,axiom,
( less(X2,X1)
| ~ divides(X1,factorial_plus_one(X2)) ),
divisor_is_smaller ).
cnf(c_0_18,axiom,
( prime(X1)
| divides(prime_divisor(X1),X1) ),
division_by_prime_divisor ).
cnf(c_0_19,negated_conjecture,
~ less(a,prime_divisor(factorial_plus_one(a))),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_14]) ).
cnf(c_0_20,plain,
( prime(factorial_plus_one(X1))
| less(X1,prime_divisor(factorial_plus_one(X1))) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_14]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : NUM016-1 : TPTP v8.1.2. Released v1.0.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n025.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 2400
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon Oct 2 13:55:21 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 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.ZoS8AZVLt3/E---3.1_21567.p
% 0.21/0.49 # Version: 3.1pre001
% 0.21/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.49 # Starting sh5l with 300s (1) cores
% 0.21/0.49 # sh5l with pid 21649 completed with status 0
% 0.21/0.49 # Result found by sh5l
% 0.21/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.49 # Starting sh5l with 300s (1) cores
% 0.21/0.49 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.49 # Search class: FGHNS-FFSF11-SFFFFFNN
% 0.21/0.49 # partial match(1): FGHNF-FFSF11-SFFFFFNN
% 0.21/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.49 # SAT001_MinMin_p005000_rr_RG with pid 21656 completed with status 0
% 0.21/0.49 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.49 # Starting sh5l with 300s (1) cores
% 0.21/0.49 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.49 # Search class: FGHNS-FFSF11-SFFFFFNN
% 0.21/0.49 # partial match(1): FGHNF-FFSF11-SFFFFFNN
% 0.21/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.49 # Preprocessing time : 0.001 s
% 0.21/0.49 # Presaturation interreduction done
% 0.21/0.49
% 0.21/0.49 # Proof found!
% 0.21/0.49 # SZS status Unsatisfiable
% 0.21/0.49 # SZS output start CNFRefutation
% See solution above
% 0.21/0.49 # Parsed axioms : 12
% 0.21/0.49 # Removed by relevancy pruning/SinE : 0
% 0.21/0.49 # Initial clauses : 12
% 0.21/0.49 # Removed in clause preprocessing : 0
% 0.21/0.49 # Initial clauses in saturation : 12
% 0.21/0.49 # Processed clauses : 36
% 0.21/0.49 # ...of these trivial : 0
% 0.21/0.49 # ...subsumed : 6
% 0.21/0.49 # ...remaining for further processing : 30
% 0.21/0.49 # Other redundant clauses eliminated : 0
% 0.21/0.49 # Clauses deleted for lack of memory : 0
% 0.21/0.49 # Backward-subsumed : 1
% 0.21/0.49 # Backward-rewritten : 0
% 0.21/0.49 # Generated clauses : 16
% 0.21/0.49 # ...of the previous two non-redundant : 13
% 0.21/0.49 # ...aggressively subsumed : 0
% 0.21/0.49 # Contextual simplify-reflections : 0
% 0.21/0.49 # Paramodulations : 16
% 0.21/0.49 # Factorizations : 0
% 0.21/0.49 # NegExts : 0
% 0.21/0.49 # Equation resolutions : 0
% 0.21/0.49 # Total rewrite steps : 5
% 0.21/0.49 # Propositional unsat checks : 0
% 0.21/0.49 # Propositional check models : 0
% 0.21/0.49 # Propositional check unsatisfiable : 0
% 0.21/0.49 # Propositional clauses : 0
% 0.21/0.49 # Propositional clauses after purity: 0
% 0.21/0.49 # Propositional unsat core size : 0
% 0.21/0.49 # Propositional preprocessing time : 0.000
% 0.21/0.49 # Propositional encoding time : 0.000
% 0.21/0.49 # Propositional solver time : 0.000
% 0.21/0.49 # Success case prop preproc time : 0.000
% 0.21/0.49 # Success case prop encoding time : 0.000
% 0.21/0.49 # Success case prop solver time : 0.000
% 0.21/0.49 # Current number of processed clauses : 17
% 0.21/0.49 # Positive orientable unit clauses : 3
% 0.21/0.49 # Positive unorientable unit clauses: 0
% 0.21/0.49 # Negative unit clauses : 4
% 0.21/0.49 # Non-unit-clauses : 10
% 0.21/0.49 # Current number of unprocessed clauses: 1
% 0.21/0.49 # ...number of literals in the above : 3
% 0.21/0.49 # Current number of archived formulas : 0
% 0.21/0.49 # Current number of archived clauses : 13
% 0.21/0.49 # Clause-clause subsumption calls (NU) : 10
% 0.21/0.49 # Rec. Clause-clause subsumption calls : 10
% 0.21/0.49 # Non-unit clause-clause subsumptions : 1
% 0.21/0.49 # Unit Clause-clause subsumption calls : 2
% 0.21/0.49 # Rewrite failures with RHS unbound : 0
% 0.21/0.49 # BW rewrite match attempts : 0
% 0.21/0.49 # BW rewrite match successes : 0
% 0.21/0.49 # Condensation attempts : 0
% 0.21/0.49 # Condensation successes : 0
% 0.21/0.49 # Termbank termtop insertions : 425
% 0.21/0.49
% 0.21/0.49 # -------------------------------------------------
% 0.21/0.49 # User time : 0.003 s
% 0.21/0.49 # System time : 0.002 s
% 0.21/0.49 # Total time : 0.005 s
% 0.21/0.49 # Maximum resident set size: 1636 pages
% 0.21/0.49
% 0.21/0.49 # -------------------------------------------------
% 0.21/0.49 # User time : 0.003 s
% 0.21/0.49 # System time : 0.005 s
% 0.21/0.49 # Total time : 0.008 s
% 0.21/0.49 # Maximum resident set size: 1676 pages
% 0.21/0.49 % E---3.1 exiting
% 0.21/0.49 % E---3.1 exiting
%------------------------------------------------------------------------------