TSTP Solution File: NUM025-2 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : NUM025-2 : TPTP v8.1.0. Bugfixed v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n026.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 : Wed Jul 27 13:07:28 EDT 2022
% Result : Unsatisfiable 1.90s 2.08s
% Output : Refutation 1.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 7 ( 5 unt; 2 nHn; 4 RR)
% Number of literals : 10 ( 0 equ; 3 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 6 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(5,axiom,
( greater_or_e_qualish(A,B)
| greater_or_e_qualish(C,A)
| ~ greater_or_e_qualish(C,B) ),
file('NUM025-2.p',unknown),
[] ).
cnf(8,axiom,
~ greater_or_e_qualish(a,b),
file('NUM025-2.p',unknown),
[] ).
cnf(9,axiom,
~ greater_or_e_qualish(b,a),
file('NUM025-2.p',unknown),
[] ).
cnf(16,axiom,
greater_or_e_qualish(A,A),
file('NUM025-2.p',unknown),
[] ).
cnf(20,plain,
( greater_or_e_qualish(A,B)
| greater_or_e_qualish(B,A) ),
inference(hyper,[status(thm)],[16,5]),
[iquote('hyper,16,5')] ).
cnf(35,plain,
greater_or_e_qualish(a,b),
inference(hyper,[status(thm)],[20,9]),
[iquote('hyper,20,9')] ).
cnf(36,plain,
$false,
inference(binary,[status(thm)],[35,8]),
[iquote('binary,35.1,8.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : NUM025-2 : TPTP v8.1.0. Bugfixed v4.0.0.
% 0.12/0.13 % Command : otter-tptp-script %s
% 0.13/0.34 % Computer : n026.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 : Wed Jul 27 10:04:24 EDT 2022
% 0.13/0.35 % CPUTime :
% 1.90/2.08 ----- Otter 3.3f, August 2004 -----
% 1.90/2.08 The process was started by sandbox on n026.cluster.edu,
% 1.90/2.08 Wed Jul 27 10:04:24 2022
% 1.90/2.08 The command was "./otter". The process ID is 4523.
% 1.90/2.08
% 1.90/2.08 set(prolog_style_variables).
% 1.90/2.08 set(auto).
% 1.90/2.08 dependent: set(auto1).
% 1.90/2.08 dependent: set(process_input).
% 1.90/2.08 dependent: clear(print_kept).
% 1.90/2.08 dependent: clear(print_new_demod).
% 1.90/2.08 dependent: clear(print_back_demod).
% 1.90/2.08 dependent: clear(print_back_sub).
% 1.90/2.08 dependent: set(control_memory).
% 1.90/2.08 dependent: assign(max_mem, 12000).
% 1.90/2.08 dependent: assign(pick_given_ratio, 4).
% 1.90/2.08 dependent: assign(stats_level, 1).
% 1.90/2.08 dependent: assign(max_seconds, 10800).
% 1.90/2.08 clear(print_given).
% 1.90/2.08
% 1.90/2.08 list(usable).
% 1.90/2.08 0 [] e_qualish(add(A,n0),A).
% 1.90/2.08 0 [] e_qualish(add(A,successor(B)),successor(add(A,B))).
% 1.90/2.08 0 [] e_qualish(multiply(A,n0),n0).
% 1.90/2.08 0 [] e_qualish(multiply(A,successor(B)),add(multiply(A,B),A)).
% 1.90/2.08 0 [] -e_qualish(successor(A),successor(B))|e_qualish(A,B).
% 1.90/2.08 0 [] -e_qualish(A,B)|e_qualish(successor(A),successor(B)).
% 1.90/2.08 0 [] e_qualish(X,X).
% 1.90/2.08 0 [] -e_qualish(X,Y)|e_qualish(Y,X).
% 1.90/2.08 0 [] -e_qualish(X,Y)| -e_qualish(Y,Z)|e_qualish(X,Z).
% 1.90/2.08 0 [] greater_or_e_qualish(A,B)|greater_or_e_qualish(C,A)| -greater_or_e_qualish(C,B).
% 1.90/2.08 0 [] -e_qualish(add(successor(A),B),C)| -greater_or_e_qualish(B,C).
% 1.90/2.08 0 [] greater_or_e_qualish(A,B)|e_qualish(add(successor(predecessor_of_1st_minus_2nd(B,A)),A),B).
% 1.90/2.08 0 [] -e_qualish(successor(A),n0).
% 1.90/2.08 0 [] greater_or_e_qualish(A,A).
% 1.90/2.08 0 [] -greater_or_e_qualish(a,b).
% 1.90/2.08 0 [] -greater_or_e_qualish(b,a).
% 1.90/2.08 end_of_list.
% 1.90/2.08
% 1.90/2.08 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=3.
% 1.90/2.08
% 1.90/2.08 This is a non-Horn set without equality. The strategy will
% 1.90/2.08 be ordered hyper_res, unit deletion, and factoring, with
% 1.90/2.08 satellites in sos and with nuclei in usable.
% 1.90/2.08
% 1.90/2.08 dependent: set(hyper_res).
% 1.90/2.08 dependent: set(factor).
% 1.90/2.08 dependent: set(unit_deletion).
% 1.90/2.08
% 1.90/2.08 ------------> process usable:
% 1.90/2.08 ** KEPT (pick-wt=8): 1 [] -e_qualish(successor(A),successor(B))|e_qualish(A,B).
% 1.90/2.08 ** KEPT (pick-wt=8): 2 [] -e_qualish(A,B)|e_qualish(successor(A),successor(B)).
% 1.90/2.08 ** KEPT (pick-wt=6): 3 [] -e_qualish(A,B)|e_qualish(B,A).
% 1.90/2.08 ** KEPT (pick-wt=9): 4 [] -e_qualish(A,B)| -e_qualish(B,C)|e_qualish(A,C).
% 1.90/2.08 ** KEPT (pick-wt=9): 5 [] greater_or_e_qualish(A,B)|greater_or_e_qualish(C,A)| -greater_or_e_qualish(C,B).
% 1.90/2.08 ** KEPT (pick-wt=9): 6 [] -e_qualish(add(successor(A),B),C)| -greater_or_e_qualish(B,C).
% 1.90/2.08 ** KEPT (pick-wt=4): 7 [] -e_qualish(successor(A),n0).
% 1.90/2.08 ** KEPT (pick-wt=3): 8 [] -greater_or_e_qualish(a,b).
% 1.90/2.08 ** KEPT (pick-wt=3): 9 [] -greater_or_e_qualish(b,a).
% 1.90/2.08
% 1.90/2.08 ------------> process sos:
% 1.90/2.08 ** KEPT (pick-wt=5): 10 [] e_qualish(add(A,n0),A).
% 1.90/2.08 ** KEPT (pick-wt=9): 11 [] e_qualish(add(A,successor(B)),successor(add(A,B))).
% 1.90/2.08 ** KEPT (pick-wt=5): 12 [] e_qualish(multiply(A,n0),n0).
% 1.90/2.08 ** KEPT (pick-wt=10): 13 [] e_qualish(multiply(A,successor(B)),add(multiply(A,B),A)).
% 1.90/2.08 ** KEPT (pick-wt=3): 14 [] e_qualish(A,A).
% 1.90/2.08 ** KEPT (pick-wt=11): 15 [] greater_or_e_qualish(A,B)|e_qualish(add(successor(predecessor_of_1st_minus_2nd(B,A)),A),B).
% 1.90/2.08 ** KEPT (pick-wt=3): 16 [] greater_or_e_qualish(A,A).
% 1.90/2.08
% 1.90/2.08 ======= end of input processing =======
% 1.90/2.08
% 1.90/2.08 =========== start of search ===========
% 1.90/2.08
% 1.90/2.08 -------- PROOF --------
% 1.90/2.08
% 1.90/2.08 ----> UNIT CONFLICT at 0.00 sec ----> 36 [binary,35.1,8.1] $F.
% 1.90/2.08
% 1.90/2.08 Length of proof is 2. Level of proof is 2.
% 1.90/2.08
% 1.90/2.08 ---------------- PROOF ----------------
% 1.90/2.08 % SZS status Unsatisfiable
% 1.90/2.08 % SZS output start Refutation
% See solution above
% 1.90/2.08 ------------ end of proof -------------
% 1.90/2.08
% 1.90/2.08
% 1.90/2.08 Search stopped by max_proofs option.
% 1.90/2.08
% 1.90/2.08
% 1.90/2.08 Search stopped by max_proofs option.
% 1.90/2.08
% 1.90/2.08 ============ end of search ============
% 1.90/2.08
% 1.90/2.08 -------------- statistics -------------
% 1.90/2.08 clauses given 8
% 1.90/2.08 clauses generated 44
% 1.90/2.08 clauses kept 35
% 1.90/2.08 clauses forward subsumed 23
% 1.90/2.08 clauses back subsumed 0
% 1.90/2.08 Kbytes malloced 976
% 1.90/2.08
% 1.90/2.08 ----------- times (seconds) -----------
% 1.90/2.08 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.90/2.08 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.90/2.08 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.90/2.08
% 1.90/2.08 That finishes the proof of the theorem.
% 1.90/2.08
% 1.90/2.08 Process 4523 finished Wed Jul 27 10:04:26 2022
% 1.90/2.08 Otter interrupted
% 1.90/2.08 PROOF FOUND
%------------------------------------------------------------------------------