TSTP Solution File: GRP044-2 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : GRP044-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n015.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 12:55:57 EDT 2022
% Result : Unsatisfiable 1.91s 2.09s
% Output : Refutation 1.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 6
% Syntax : Number of clauses : 9 ( 7 unt; 0 nHn; 8 RR)
% Number of literals : 14 ( 0 equ; 6 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 11 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(3,axiom,
( ~ product(A,B,C)
| ~ product(B,D,E)
| ~ product(A,E,F)
| product(C,D,F) ),
file('GRP044-2.p',unknown),
[] ).
cnf(4,axiom,
( ~ e_qualish(A,B)
| ~ product(C,D,A)
| product(C,D,B) ),
file('GRP044-2.p',unknown),
[] ).
cnf(5,axiom,
~ product(b,c,result),
file('GRP044-2.p',unknown),
[] ).
cnf(6,axiom,
product(identity,A,A),
file('GRP044-2.p',unknown),
[] ).
cnf(9,axiom,
e_qualish(a,b),
file('GRP044-2.p',unknown),
[] ).
cnf(10,axiom,
product(a,c,result),
file('GRP044-2.p',unknown),
[] ).
cnf(12,plain,
product(identity,a,b),
inference(hyper,[status(thm)],[9,4,6]),
[iquote('hyper,9,4,6')] ).
cnf(13,plain,
product(b,c,result),
inference(hyper,[status(thm)],[12,3,10,6]),
[iquote('hyper,12,3,10,6')] ).
cnf(14,plain,
$false,
inference(binary,[status(thm)],[13,5]),
[iquote('binary,13.1,5.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : GRP044-2 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n015.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 05:32:11 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.91/2.09 ----- Otter 3.3f, August 2004 -----
% 1.91/2.09 The process was started by sandbox on n015.cluster.edu,
% 1.91/2.09 Wed Jul 27 05:32:11 2022
% 1.91/2.09 The command was "./otter". The process ID is 9914.
% 1.91/2.09
% 1.91/2.09 set(prolog_style_variables).
% 1.91/2.09 set(auto).
% 1.91/2.09 dependent: set(auto1).
% 1.91/2.09 dependent: set(process_input).
% 1.91/2.09 dependent: clear(print_kept).
% 1.91/2.09 dependent: clear(print_new_demod).
% 1.91/2.09 dependent: clear(print_back_demod).
% 1.91/2.09 dependent: clear(print_back_sub).
% 1.91/2.09 dependent: set(control_memory).
% 1.91/2.09 dependent: assign(max_mem, 12000).
% 1.91/2.09 dependent: assign(pick_given_ratio, 4).
% 1.91/2.09 dependent: assign(stats_level, 1).
% 1.91/2.09 dependent: assign(max_seconds, 10800).
% 1.91/2.09 clear(print_given).
% 1.91/2.09
% 1.91/2.09 list(usable).
% 1.91/2.09 0 [] product(identity,X,X).
% 1.91/2.09 0 [] product(inverse(X),X,identity).
% 1.91/2.09 0 [] product(X,Y,multiply(X,Y)).
% 1.91/2.09 0 [] -product(X,Y,Z)| -product(X,Y,W)|e_qualish(Z,W).
% 1.91/2.09 0 [] -product(X,Y,U)| -product(Y,Z,V)| -product(U,Z,W)|product(X,V,W).
% 1.91/2.09 0 [] -product(X,Y,U)| -product(Y,Z,V)| -product(X,V,W)|product(U,Z,W).
% 1.91/2.09 0 [] -e_qualish(X,Y)| -product(W,Z,X)|product(W,Z,Y).
% 1.91/2.09 0 [] e_qualish(a,b).
% 1.91/2.09 0 [] product(a,c,result).
% 1.91/2.09 0 [] -product(b,c,result).
% 1.91/2.09 end_of_list.
% 1.91/2.09
% 1.91/2.09 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=4.
% 1.91/2.09
% 1.91/2.09 This is a Horn set without equality. The strategy will
% 1.91/2.09 be hyperresolution, with satellites in sos and nuclei
% 1.91/2.09 in usable.
% 1.91/2.09
% 1.91/2.09 dependent: set(hyper_res).
% 1.91/2.09 dependent: clear(order_hyper).
% 1.91/2.09
% 1.91/2.09 ------------> process usable:
% 1.91/2.09 ** KEPT (pick-wt=11): 1 [] -product(A,B,C)| -product(A,B,D)|e_qualish(C,D).
% 1.91/2.09 ** KEPT (pick-wt=16): 2 [] -product(A,B,C)| -product(B,D,E)| -product(C,D,F)|product(A,E,F).
% 1.91/2.09 ** KEPT (pick-wt=16): 3 [] -product(A,B,C)| -product(B,D,E)| -product(A,E,F)|product(C,D,F).
% 1.91/2.09 ** KEPT (pick-wt=11): 4 [] -e_qualish(A,B)| -product(C,D,A)|product(C,D,B).
% 1.91/2.09 ** KEPT (pick-wt=4): 5 [] -product(b,c,result).
% 1.91/2.09
% 1.91/2.09 ------------> process sos:
% 1.91/2.09 ** KEPT (pick-wt=4): 6 [] product(identity,A,A).
% 1.91/2.09 ** KEPT (pick-wt=5): 7 [] product(inverse(A),A,identity).
% 1.91/2.09 ** KEPT (pick-wt=6): 8 [] product(A,B,multiply(A,B)).
% 1.91/2.09 ** KEPT (pick-wt=3): 9 [] e_qualish(a,b).
% 1.91/2.09 ** KEPT (pick-wt=4): 10 [] product(a,c,result).
% 1.91/2.09
% 1.91/2.09 ======= end of input processing =======
% 1.91/2.09
% 1.91/2.09 =========== start of search ===========
% 1.91/2.09
% 1.91/2.09 -------- PROOF --------
% 1.91/2.09
% 1.91/2.09 ----> UNIT CONFLICT at 0.00 sec ----> 14 [binary,13.1,5.1] $F.
% 1.91/2.09
% 1.91/2.09 Length of proof is 2. Level of proof is 2.
% 1.91/2.09
% 1.91/2.09 ---------------- PROOF ----------------
% 1.91/2.09 % SZS status Unsatisfiable
% 1.91/2.09 % SZS output start Refutation
% See solution above
% 1.91/2.09 ------------ end of proof -------------
% 1.91/2.09
% 1.91/2.09
% 1.91/2.09 Search stopped by max_proofs option.
% 1.91/2.09
% 1.91/2.09
% 1.91/2.09 Search stopped by max_proofs option.
% 1.91/2.09
% 1.91/2.09 ============ end of search ============
% 1.91/2.09
% 1.91/2.09 -------------- statistics -------------
% 1.91/2.09 clauses given 5
% 1.91/2.09 clauses generated 20
% 1.91/2.09 clauses kept 13
% 1.91/2.09 clauses forward subsumed 17
% 1.91/2.09 clauses back subsumed 0
% 1.91/2.09 Kbytes malloced 976
% 1.91/2.09
% 1.91/2.09 ----------- times (seconds) -----------
% 1.91/2.09 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.91/2.09 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.91/2.09 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.91/2.09
% 1.91/2.09 That finishes the proof of the theorem.
% 1.91/2.09
% 1.91/2.09 Process 9914 finished Wed Jul 27 05:32:13 2022
% 1.91/2.09 Otter interrupted
% 1.91/2.09 PROOF FOUND
%------------------------------------------------------------------------------