TSTP Solution File: RNG038-2 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : RNG038-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n020.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:12:09 EDT 2022
% Result : Unsatisfiable 1.95s 2.15s
% Output : Refutation 1.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 10 ( 7 unt; 0 nHn; 4 RR)
% Number of literals : 15 ( 0 equ; 6 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 15 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(19,axiom,
( ~ sum(A,B,C)
| ~ sum(A,B,D)
| e_qualish(C,D) ),
file('RNG038-2.p',unknown),
[] ).
cnf(20,axiom,
( ~ product(A,B,C)
| ~ product(A,B,D)
| e_qualish(C,D) ),
file('RNG038-2.p',unknown),
[] ).
cnf(21,axiom,
( ~ e_qualish(A,additive_identity)
| product(A,h(A,B),B) ),
file('RNG038-2.p',unknown),
[] ).
cnf(23,axiom,
~ e_qualish(b,additive_identity),
file('RNG038-2.p',unknown),
[] ).
cnf(24,axiom,
sum(A,additive_identity,A),
file('RNG038-2.p',unknown),
[] ).
cnf(28,axiom,
product(additive_identity,A,additive_identity),
file('RNG038-2.p',unknown),
[] ).
cnf(31,plain,
e_qualish(A,A),
inference(hyper,[status(thm)],[24,19,24]),
[iquote('hyper,24,19,24')] ).
cnf(33,plain,
product(additive_identity,h(additive_identity,A),A),
inference(hyper,[status(thm)],[31,21]),
[iquote('hyper,31,21')] ).
cnf(343,plain,
e_qualish(A,additive_identity),
inference(hyper,[status(thm)],[33,20,28]),
[iquote('hyper,33,20,28')] ).
cnf(344,plain,
$false,
inference(binary,[status(thm)],[343,23]),
[iquote('binary,343.1,23.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : RNG038-2 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n020.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Wed Jul 27 02:18:53 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.95/2.14 ----- Otter 3.3f, August 2004 -----
% 1.95/2.14 The process was started by sandbox on n020.cluster.edu,
% 1.95/2.14 Wed Jul 27 02:18:53 2022
% 1.95/2.14 The command was "./otter". The process ID is 4630.
% 1.95/2.14
% 1.95/2.14 set(prolog_style_variables).
% 1.95/2.14 set(auto).
% 1.95/2.14 dependent: set(auto1).
% 1.95/2.14 dependent: set(process_input).
% 1.95/2.14 dependent: clear(print_kept).
% 1.95/2.14 dependent: clear(print_new_demod).
% 1.95/2.14 dependent: clear(print_back_demod).
% 1.95/2.14 dependent: clear(print_back_sub).
% 1.95/2.14 dependent: set(control_memory).
% 1.95/2.14 dependent: assign(max_mem, 12000).
% 1.95/2.14 dependent: assign(pick_given_ratio, 4).
% 1.95/2.14 dependent: assign(stats_level, 1).
% 1.95/2.14 dependent: assign(max_seconds, 10800).
% 1.95/2.14 clear(print_given).
% 1.95/2.14
% 1.95/2.14 list(usable).
% 1.95/2.14 0 [] -e_qualish(X,Y)|e_qualish(additive_inverse(X),additive_inverse(Y)).
% 1.95/2.14 0 [] -e_qualish(X,Y)|e_qualish(add(X,W),add(Y,W)).
% 1.95/2.14 0 [] -e_qualish(X,Y)| -sum(X,W,Z)|sum(Y,W,Z).
% 1.95/2.14 0 [] -e_qualish(X,Y)| -sum(W,X,Z)|sum(W,Y,Z).
% 1.95/2.14 0 [] -e_qualish(X,Y)| -sum(W,Z,X)|sum(W,Z,Y).
% 1.95/2.14 0 [] -e_qualish(X,Y)|e_qualish(multiply(X,W),multiply(Y,W)).
% 1.95/2.14 0 [] -e_qualish(X,Y)| -product(X,W,Z)|product(Y,W,Z).
% 1.95/2.14 0 [] -e_qualish(X,Y)| -product(W,X,Z)|product(W,Y,Z).
% 1.95/2.14 0 [] -e_qualish(X,Y)| -product(W,Z,X)|product(W,Z,Y).
% 1.95/2.14 0 [] sum(X,additive_identity,X).
% 1.95/2.14 0 [] product(X,Y,multiply(X,Y)).
% 1.95/2.14 0 [] sum(X,Y,add(X,Y)).
% 1.95/2.14 0 [] sum(X,additive_inverse(X),additive_identity).
% 1.95/2.14 0 [] -sum(X,Y,U)| -sum(Y,Z,V)| -sum(U,Z,W)|sum(X,V,W).
% 1.95/2.14 0 [] -sum(X,Y,U)| -sum(Y,Z,V)| -sum(X,V,W)|sum(U,Z,W).
% 1.95/2.14 0 [] -sum(X,Y,Z)|sum(Y,X,Z).
% 1.95/2.14 0 [] -product(X,Y,U)| -product(Y,Z,V)| -product(U,Z,W)|product(X,V,W).
% 1.95/2.14 0 [] -product(X,Y,U)| -product(Y,Z,V)| -product(X,V,W)|product(U,Z,W).
% 1.95/2.14 0 [] -product(X,Y,V1)| -product(X,Z,V2)| -sum(Y,Z,V3)| -product(X,V3,V4)|sum(V1,V2,V4).
% 1.95/2.14 0 [] -product(X,Y,V1)| -product(X,Z,V2)| -sum(Y,Z,V3)| -sum(V1,V2,V4)|product(X,V3,V4).
% 1.95/2.14 0 [] -product(Y,X,V1)| -product(Z,X,V2)| -sum(Y,Z,V3)| -product(V3,X,V4)|sum(V1,V2,V4).
% 1.95/2.14 0 [] -product(Y,X,V1)| -product(Z,X,V2)| -sum(Y,Z,V3)| -sum(V1,V2,V4)|product(V3,X,V4).
% 1.95/2.14 0 [] -sum(X,Y,U)| -sum(X,Y,V)|e_qualish(U,V).
% 1.95/2.14 0 [] -product(X,Y,U)| -product(X,Y,V)|e_qualish(U,V).
% 1.95/2.14 0 [] product(additive_identity,X,additive_identity).
% 1.95/2.14 0 [] product(X,additive_identity,additive_identity).
% 1.95/2.14 0 [] -e_qualish(X,additive_identity)|product(X,h(X,Y),Y).
% 1.95/2.14 0 [] product(a,b,additive_identity).
% 1.95/2.14 0 [] -e_qualish(a,additive_identity).
% 1.95/2.14 0 [] -e_qualish(b,additive_identity).
% 1.95/2.14 end_of_list.
% 1.95/2.14
% 1.95/2.14 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=5.
% 1.95/2.14
% 1.95/2.14 This is a Horn set without equality. The strategy will
% 1.95/2.14 be hyperresolution, with satellites in sos and nuclei
% 1.95/2.14 in usable.
% 1.95/2.14
% 1.95/2.14 dependent: set(hyper_res).
% 1.95/2.14 dependent: clear(order_hyper).
% 1.95/2.14
% 1.95/2.14 ------------> process usable:
% 1.95/2.14 ** KEPT (pick-wt=8): 1 [] -e_qualish(A,B)|e_qualish(additive_inverse(A),additive_inverse(B)).
% 1.95/2.14 ** KEPT (pick-wt=10): 2 [] -e_qualish(A,B)|e_qualish(add(A,C),add(B,C)).
% 1.95/2.14 ** KEPT (pick-wt=11): 3 [] -e_qualish(A,B)| -sum(A,C,D)|sum(B,C,D).
% 1.95/2.14 ** KEPT (pick-wt=11): 4 [] -e_qualish(A,B)| -sum(C,A,D)|sum(C,B,D).
% 1.95/2.14 ** KEPT (pick-wt=11): 5 [] -e_qualish(A,B)| -sum(C,D,A)|sum(C,D,B).
% 1.95/2.14 ** KEPT (pick-wt=10): 6 [] -e_qualish(A,B)|e_qualish(multiply(A,C),multiply(B,C)).
% 1.95/2.14 ** KEPT (pick-wt=11): 7 [] -e_qualish(A,B)| -product(A,C,D)|product(B,C,D).
% 1.95/2.14 ** KEPT (pick-wt=11): 8 [] -e_qualish(A,B)| -product(C,A,D)|product(C,B,D).
% 1.95/2.14 ** KEPT (pick-wt=11): 9 [] -e_qualish(A,B)| -product(C,D,A)|product(C,D,B).
% 1.95/2.14 ** KEPT (pick-wt=16): 10 [] -sum(A,B,C)| -sum(B,D,E)| -sum(C,D,F)|sum(A,E,F).
% 1.95/2.14 ** KEPT (pick-wt=16): 11 [] -sum(A,B,C)| -sum(B,D,E)| -sum(A,E,F)|sum(C,D,F).
% 1.95/2.14 ** KEPT (pick-wt=8): 12 [] -sum(A,B,C)|sum(B,A,C).
% 1.95/2.14 ** KEPT (pick-wt=16): 13 [] -product(A,B,C)| -product(B,D,E)| -product(C,D,F)|product(A,E,F).
% 1.95/2.14 ** KEPT (pick-wt=16): 14 [] -product(A,B,C)| -product(B,D,E)| -product(A,E,F)|product(C,D,F).
% 1.95/2.14 ** KEPT (pick-wt=20): 15 [] -product(A,B,C)| -product(A,D,E)| -sum(B,D,F)| -product(A,F,G)|sum(C,E,G).
% 1.95/2.14 ** KEPT (pick-wt=20): 16 [] -product(A,B,C)| -product(A,D,E)| -sum(B,D,F)| -sum(C,E,G)|product(A,F,G).
% 1.95/2.14 ** KEPT (pick-wt=20): 17 [] -product(A,B,C)| -product(D,B,E)| -sum(A,D,F)| -product(F,B,G)|sum(C,E,G).
% 1.95/2.14 ** KEPT (pick-wt=20): 18 [] -product(A,B,C)| -product(D,B,E)| -sum(A,D,F)| -sum(C,E,G)|product(F,B,G).
% 1.95/2.14 ** KEPT (pick-wt=11): 19 [] -sum(A,B,C)| -sum(A,B,D)|e_qualish(C,D).
% 1.95/2.15 ** KEPT (pick-wt=11): 20 [] -product(A,B,C)| -product(A,B,D)|e_qualish(C,D).
% 1.95/2.15 ** KEPT (pick-wt=9): 21 [] -e_qualish(A,additive_identity)|product(A,h(A,B),B).
% 1.95/2.15 ** KEPT (pick-wt=3): 22 [] -e_qualish(a,additive_identity).
% 1.95/2.15 ** KEPT (pick-wt=3): 23 [] -e_qualish(b,additive_identity).
% 1.95/2.15
% 1.95/2.15 ------------> process sos:
% 1.95/2.15 ** KEPT (pick-wt=4): 24 [] sum(A,additive_identity,A).
% 1.95/2.15 ** KEPT (pick-wt=6): 25 [] product(A,B,multiply(A,B)).
% 1.95/2.15 ** KEPT (pick-wt=6): 26 [] sum(A,B,add(A,B)).
% 1.95/2.15 ** KEPT (pick-wt=5): 27 [] sum(A,additive_inverse(A),additive_identity).
% 1.95/2.15 ** KEPT (pick-wt=4): 28 [] product(additive_identity,A,additive_identity).
% 1.95/2.15 ** KEPT (pick-wt=4): 29 [] product(A,additive_identity,additive_identity).
% 1.95/2.15 ** KEPT (pick-wt=4): 30 [] product(a,b,additive_identity).
% 1.95/2.15
% 1.95/2.15 ======= end of input processing =======
% 1.95/2.15
% 1.95/2.15 =========== start of search ===========
% 1.95/2.15
% 1.95/2.15 -------- PROOF --------
% 1.95/2.15
% 1.95/2.15 ----> UNIT CONFLICT at 0.01 sec ----> 344 [binary,343.1,23.1] $F.
% 1.95/2.15
% 1.95/2.15 Length of proof is 3. Level of proof is 3.
% 1.95/2.15
% 1.95/2.15 ---------------- PROOF ----------------
% 1.95/2.15 % SZS status Unsatisfiable
% 1.95/2.15 % SZS output start Refutation
% See solution above
% 1.95/2.15 ------------ end of proof -------------
% 1.95/2.15
% 1.95/2.15
% 1.95/2.15 Search stopped by max_proofs option.
% 1.95/2.15
% 1.95/2.15
% 1.95/2.15 Search stopped by max_proofs option.
% 1.95/2.15
% 1.95/2.15 ============ end of search ============
% 1.95/2.15
% 1.95/2.15 -------------- statistics -------------
% 1.95/2.15 clauses given 16
% 1.95/2.15 clauses generated 922
% 1.95/2.15 clauses kept 343
% 1.95/2.15 clauses forward subsumed 609
% 1.95/2.15 clauses back subsumed 41
% 1.95/2.15 Kbytes malloced 976
% 1.95/2.15
% 1.95/2.15 ----------- times (seconds) -----------
% 1.95/2.15 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.95/2.15 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.95/2.15 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.95/2.15
% 1.95/2.15 That finishes the proof of the theorem.
% 1.95/2.15
% 1.95/2.15 Process 4630 finished Wed Jul 27 02:18:55 2022
% 1.95/2.15 Otter interrupted
% 1.95/2.15 PROOF FOUND
%------------------------------------------------------------------------------