TSTP Solution File: NUM001-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : NUM001-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n011.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:24 EDT 2022
% Result : Unsatisfiable 2.19s 2.32s
% Output : Refutation 2.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 8
% Syntax : Number of clauses : 12 ( 9 unt; 0 nHn; 5 RR)
% Number of literals : 18 ( 0 equ; 7 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 29 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ e_qualish(A,B)
| ~ e_qualish(B,C)
| e_qualish(A,C) ),
file('NUM001-1.p',unknown),
[] ).
cnf(4,axiom,
( ~ e_qualish(A,B)
| ~ e_qualish(C,subtract(A,D))
| e_qualish(C,subtract(B,D)) ),
file('NUM001-1.p',unknown),
[] ).
cnf(5,axiom,
( ~ e_qualish(A,B)
| ~ e_qualish(C,subtract(D,A))
| e_qualish(C,subtract(D,B)) ),
file('NUM001-1.p',unknown),
[] ).
cnf(6,axiom,
~ e_qualish(add(add(a,b),c),add(a,add(b,c))),
file('NUM001-1.p',unknown),
[] ).
cnf(8,axiom,
e_qualish(add(A,B),add(B,A)),
file('NUM001-1.p',unknown),
[] ).
cnf(9,axiom,
e_qualish(add(A,add(B,C)),add(add(A,B),C)),
file('NUM001-1.p',unknown),
[] ).
cnf(10,axiom,
e_qualish(subtract(add(A,B),B),A),
file('NUM001-1.p',unknown),
[] ).
cnf(11,axiom,
e_qualish(A,subtract(add(A,B),B)),
file('NUM001-1.p',unknown),
[] ).
cnf(42,plain,
e_qualish(A,subtract(add(B,A),B)),
inference(hyper,[status(thm)],[11,4,8]),
[iquote('hyper,11,4,8')] ).
cnf(77,plain,
e_qualish(A,subtract(add(add(B,add(C,D)),A),add(add(B,C),D))),
inference(hyper,[status(thm)],[9,5,42]),
[iquote('hyper,9,5,42')] ).
cnf(2565,plain,
e_qualish(add(add(A,B),C),add(A,add(B,C))),
inference(hyper,[status(thm)],[77,1,10]),
[iquote('hyper,77,1,10')] ).
cnf(2566,plain,
$false,
inference(binary,[status(thm)],[2565,6]),
[iquote('binary,2565.1,6.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : NUM001-1 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.13 % Command : otter-tptp-script %s
% 0.13/0.34 % Computer : n011.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 09:38:40 EDT 2022
% 0.13/0.34 % CPUTime :
% 2.19/2.32 ----- Otter 3.3f, August 2004 -----
% 2.19/2.32 The process was started by sandbox2 on n011.cluster.edu,
% 2.19/2.32 Wed Jul 27 09:38:41 2022
% 2.19/2.32 The command was "./otter". The process ID is 3791.
% 2.19/2.32
% 2.19/2.32 set(prolog_style_variables).
% 2.19/2.32 set(auto).
% 2.19/2.32 dependent: set(auto1).
% 2.19/2.32 dependent: set(process_input).
% 2.19/2.32 dependent: clear(print_kept).
% 2.19/2.32 dependent: clear(print_new_demod).
% 2.19/2.32 dependent: clear(print_back_demod).
% 2.19/2.32 dependent: clear(print_back_sub).
% 2.19/2.32 dependent: set(control_memory).
% 2.19/2.32 dependent: assign(max_mem, 12000).
% 2.19/2.32 dependent: assign(pick_given_ratio, 4).
% 2.19/2.32 dependent: assign(stats_level, 1).
% 2.19/2.32 dependent: assign(max_seconds, 10800).
% 2.19/2.32 clear(print_given).
% 2.19/2.32
% 2.19/2.32 list(usable).
% 2.19/2.32 0 [] e_qualish(A,A).
% 2.19/2.32 0 [] -e_qualish(A,B)| -e_qualish(B,C)|e_qualish(A,C).
% 2.19/2.32 0 [] e_qualish(add(A,B),add(B,A)).
% 2.19/2.32 0 [] e_qualish(add(A,add(B,C)),add(add(A,B),C)).
% 2.19/2.32 0 [] e_qualish(subtract(add(A,B),B),A).
% 2.19/2.32 0 [] e_qualish(A,subtract(add(A,B),B)).
% 2.19/2.32 0 [] e_qualish(add(subtract(A,B),C),subtract(add(A,C),B)).
% 2.19/2.32 0 [] e_qualish(subtract(add(A,B),C),add(subtract(A,C),B)).
% 2.19/2.32 0 [] -e_qualish(A,B)| -e_qualish(C,add(A,D))|e_qualish(C,add(B,D)).
% 2.19/2.32 0 [] -e_qualish(A,B)| -e_qualish(C,add(D,A))|e_qualish(C,add(D,B)).
% 2.19/2.32 0 [] -e_qualish(A,B)| -e_qualish(C,subtract(A,D))|e_qualish(C,subtract(B,D)).
% 2.19/2.32 0 [] -e_qualish(A,B)| -e_qualish(C,subtract(D,A))|e_qualish(C,subtract(D,B)).
% 2.19/2.32 0 [] -e_qualish(add(add(a,b),c),add(a,add(b,c))).
% 2.19/2.32 end_of_list.
% 2.19/2.32
% 2.19/2.32 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 2.19/2.32
% 2.19/2.32 This is a Horn set without equality. The strategy will
% 2.19/2.32 be hyperresolution, with satellites in sos and nuclei
% 2.19/2.32 in usable.
% 2.19/2.32
% 2.19/2.32 dependent: set(hyper_res).
% 2.19/2.32 dependent: clear(order_hyper).
% 2.19/2.32
% 2.19/2.32 ------------> process usable:
% 2.19/2.32 ** KEPT (pick-wt=9): 1 [] -e_qualish(A,B)| -e_qualish(B,C)|e_qualish(A,C).
% 2.19/2.32 ** KEPT (pick-wt=13): 2 [] -e_qualish(A,B)| -e_qualish(C,add(A,D))|e_qualish(C,add(B,D)).
% 2.19/2.32 ** KEPT (pick-wt=13): 3 [] -e_qualish(A,B)| -e_qualish(C,add(D,A))|e_qualish(C,add(D,B)).
% 2.19/2.32 ** KEPT (pick-wt=13): 4 [] -e_qualish(A,B)| -e_qualish(C,subtract(A,D))|e_qualish(C,subtract(B,D)).
% 2.19/2.32 ** KEPT (pick-wt=13): 5 [] -e_qualish(A,B)| -e_qualish(C,subtract(D,A))|e_qualish(C,subtract(D,B)).
% 2.19/2.32 ** KEPT (pick-wt=11): 6 [] -e_qualish(add(add(a,b),c),add(a,add(b,c))).
% 2.19/2.32
% 2.19/2.32 ------------> process sos:
% 2.19/2.32 ** KEPT (pick-wt=3): 7 [] e_qualish(A,A).
% 2.19/2.32 ** KEPT (pick-wt=7): 8 [] e_qualish(add(A,B),add(B,A)).
% 2.19/2.32 ** KEPT (pick-wt=11): 9 [] e_qualish(add(A,add(B,C)),add(add(A,B),C)).
% 2.19/2.32 ** KEPT (pick-wt=7): 10 [] e_qualish(subtract(add(A,B),B),A).
% 2.19/2.32 ** KEPT (pick-wt=7): 11 [] e_qualish(A,subtract(add(A,B),B)).
% 2.19/2.32 ** KEPT (pick-wt=11): 12 [] e_qualish(add(subtract(A,B),C),subtract(add(A,C),B)).
% 2.19/2.32 ** KEPT (pick-wt=11): 13 [] e_qualish(subtract(add(A,B),C),add(subtract(A,C),B)).
% 2.19/2.32
% 2.19/2.32 ======= end of input processing =======
% 2.19/2.32
% 2.19/2.32 =========== start of search ===========
% 2.19/2.32
% 2.19/2.32
% 2.19/2.32 Resetting weight limit to 11.
% 2.19/2.32
% 2.19/2.32
% 2.19/2.32 Resetting weight limit to 11.
% 2.19/2.32
% 2.19/2.32 sos_size=2406
% 2.19/2.32
% 2.19/2.32 -------- PROOF --------
% 2.19/2.32
% 2.19/2.32 ----> UNIT CONFLICT at 0.15 sec ----> 2566 [binary,2565.1,6.1] $F.
% 2.19/2.32
% 2.19/2.32 Length of proof is 3. Level of proof is 3.
% 2.19/2.32
% 2.19/2.32 ---------------- PROOF ----------------
% 2.19/2.32 % SZS status Unsatisfiable
% 2.19/2.32 % SZS output start Refutation
% See solution above
% 2.19/2.32 ------------ end of proof -------------
% 2.19/2.32
% 2.19/2.32
% 2.19/2.32 Search stopped by max_proofs option.
% 2.19/2.32
% 2.19/2.32
% 2.19/2.32 Search stopped by max_proofs option.
% 2.19/2.32
% 2.19/2.32 ============ end of search ============
% 2.19/2.32
% 2.19/2.32 -------------- statistics -------------
% 2.19/2.32 clauses given 111
% 2.19/2.32 clauses generated 31307
% 2.19/2.32 clauses kept 2565
% 2.19/2.32 clauses forward subsumed 2261
% 2.19/2.32 clauses back subsumed 0
% 2.19/2.32 Kbytes malloced 4882
% 2.19/2.32
% 2.19/2.32 ----------- times (seconds) -----------
% 2.19/2.32 user CPU time 0.15 (0 hr, 0 min, 0 sec)
% 2.19/2.32 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 2.19/2.32 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 2.19/2.32
% 2.19/2.32 That finishes the proof of the theorem.
% 2.19/2.32
% 2.19/2.32 Process 3791 finished Wed Jul 27 09:38:42 2022
% 2.19/2.32 Otter interrupted
% 2.19/2.32 PROOF FOUND
%------------------------------------------------------------------------------