TSTP Solution File: GRP123-1.003 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : GRP123-1.003 : TPTP v8.1.0. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n029.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:56:07 EDT 2022
% Result : Unsatisfiable 1.65s 1.87s
% Output : Refutation 1.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of clauses : 18 ( 10 unt; 5 nHn; 17 RR)
% Number of literals : 37 ( 0 equ; 13 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 17 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(5,axiom,
~ e_qualish(e_3,e_1),
file('GRP123-1.003.p',unknown),
[] ).
cnf(6,axiom,
~ e_qualish(e_3,e_2),
file('GRP123-1.003.p',unknown),
[] ).
cnf(7,axiom,
( ~ group_element(A)
| ~ group_element(B)
| product(A,B,e_1)
| product(A,B,e_2)
| product(A,B,e_3) ),
file('GRP123-1.003.p',unknown),
[] ).
cnf(10,axiom,
( ~ product(A,B,C)
| ~ product(D,B,C)
| e_qualish(A,D) ),
file('GRP123-1.003.p',unknown),
[] ).
cnf(12,axiom,
( ~ product(A,B,C)
| ~ product(D,E,C)
| ~ product(F,B,A)
| ~ product(F,E,D)
| e_qualish(B,E) ),
file('GRP123-1.003.p',unknown),
[] ).
cnf(20,plain,
( ~ product(A,B,C)
| ~ product(C,D,C)
| ~ product(C,B,A)
| e_qualish(B,D) ),
inference(factor,[status(thm)],[12]),
[iquote('factor,12.2.4')] ).
cnf(21,axiom,
group_element(e_1),
file('GRP123-1.003.p',unknown),
[] ).
cnf(22,axiom,
group_element(e_2),
file('GRP123-1.003.p',unknown),
[] ).
cnf(23,axiom,
group_element(e_3),
file('GRP123-1.003.p',unknown),
[] ).
cnf(24,axiom,
product(A,A,A),
file('GRP123-1.003.p',unknown),
[] ).
cnf(27,plain,
( product(e_2,e_3,e_1)
| product(e_2,e_3,e_2)
| product(e_2,e_3,e_3) ),
inference(hyper,[status(thm)],[23,7,22]),
[iquote('hyper,23,7,22')] ).
cnf(28,plain,
( product(e_1,e_3,e_1)
| product(e_1,e_3,e_2)
| product(e_1,e_3,e_3) ),
inference(hyper,[status(thm)],[23,7,21]),
[iquote('hyper,23,7,21')] ).
cnf(38,plain,
( product(e_2,e_3,e_1)
| product(e_2,e_3,e_3) ),
inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[27,20,27,24]),6])])]),
[iquote('hyper,27,20,27,24,unit_del,6,factor_simp,factor_simp')] ).
cnf(40,plain,
product(e_2,e_3,e_1),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[38,10,24]),6]),
[iquote('hyper,38,10,24,unit_del,6')] ).
cnf(41,plain,
( product(e_1,e_3,e_2)
| product(e_1,e_3,e_3) ),
inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[28,20,28,24]),5])])]),
[iquote('hyper,28,20,28,24,unit_del,5,factor_simp,factor_simp')] ).
cnf(47,plain,
product(e_1,e_3,e_3),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[41,20,40,24]),5]),
[iquote('hyper,41,20,40,24,unit_del,5')] ).
cnf(49,plain,
e_qualish(e_3,e_1),
inference(hyper,[status(thm)],[47,10,24]),
[iquote('hyper,47,10,24')] ).
cnf(50,plain,
$false,
inference(binary,[status(thm)],[49,5]),
[iquote('binary,49.1,5.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP123-1.003 : TPTP v8.1.0. Released v1.2.0.
% 0.11/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n029.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.18/0.33 % CPULimit : 300
% 0.18/0.33 % WCLimit : 300
% 0.18/0.33 % DateTime : Wed Jul 27 05:07:14 EDT 2022
% 0.18/0.33 % CPUTime :
% 1.65/1.87 ----- Otter 3.3f, August 2004 -----
% 1.65/1.87 The process was started by sandbox on n029.cluster.edu,
% 1.65/1.87 Wed Jul 27 05:07:14 2022
% 1.65/1.87 The command was "./otter". The process ID is 4154.
% 1.65/1.87
% 1.65/1.87 set(prolog_style_variables).
% 1.65/1.87 set(auto).
% 1.65/1.87 dependent: set(auto1).
% 1.65/1.87 dependent: set(process_input).
% 1.65/1.87 dependent: clear(print_kept).
% 1.65/1.87 dependent: clear(print_new_demod).
% 1.65/1.87 dependent: clear(print_back_demod).
% 1.65/1.87 dependent: clear(print_back_sub).
% 1.65/1.87 dependent: set(control_memory).
% 1.65/1.87 dependent: assign(max_mem, 12000).
% 1.65/1.87 dependent: assign(pick_given_ratio, 4).
% 1.65/1.87 dependent: assign(stats_level, 1).
% 1.65/1.87 dependent: assign(max_seconds, 10800).
% 1.65/1.87 clear(print_given).
% 1.65/1.87
% 1.65/1.87 list(usable).
% 1.65/1.87 0 [] group_element(e_1).
% 1.65/1.87 0 [] group_element(e_2).
% 1.65/1.87 0 [] group_element(e_3).
% 1.65/1.87 0 [] -e_qualish(e_1,e_2).
% 1.65/1.87 0 [] -e_qualish(e_1,e_3).
% 1.65/1.87 0 [] -e_qualish(e_2,e_1).
% 1.65/1.87 0 [] -e_qualish(e_2,e_3).
% 1.65/1.87 0 [] -e_qualish(e_3,e_1).
% 1.65/1.87 0 [] -e_qualish(e_3,e_2).
% 1.65/1.87 0 [] -group_element(X)| -group_element(Y)|product(X,Y,e_1)|product(X,Y,e_2)|product(X,Y,e_3).
% 1.65/1.87 0 [] -product(X,Y,W)| -product(X,Y,Z)|e_qualish(W,Z).
% 1.65/1.87 0 [] -product(X,W,Y)| -product(X,Z,Y)|e_qualish(W,Z).
% 1.65/1.87 0 [] -product(W,Y,X)| -product(Z,Y,X)|e_qualish(W,Z).
% 1.65/1.87 0 [] product(X,X,X).
% 1.65/1.87 0 [] -product(X1,Y1,Z1)| -product(X2,Y2,Z1)| -product(Z2,Y1,X1)| -product(Z2,Y2,X2)|e_qualish(X1,X2).
% 1.65/1.87 0 [] -product(X1,Y1,Z1)| -product(X2,Y2,Z1)| -product(Z2,Y1,X1)| -product(Z2,Y2,X2)|e_qualish(Y1,Y2).
% 1.65/1.87 end_of_list.
% 1.65/1.87
% 1.65/1.87 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=5.
% 1.65/1.87
% 1.65/1.87 This is a non-Horn set without equality. The strategy will
% 1.65/1.87 be ordered hyper_res, unit deletion, and factoring, with
% 1.65/1.87 satellites in sos and with nuclei in usable.
% 1.65/1.87
% 1.65/1.87 dependent: set(hyper_res).
% 1.65/1.87 dependent: set(factor).
% 1.65/1.87 dependent: set(unit_deletion).
% 1.65/1.87
% 1.65/1.87 ------------> process usable:
% 1.65/1.87 ** KEPT (pick-wt=3): 1 [] -e_qualish(e_1,e_2).
% 1.65/1.87 ** KEPT (pick-wt=3): 2 [] -e_qualish(e_1,e_3).
% 1.65/1.87 ** KEPT (pick-wt=3): 3 [] -e_qualish(e_2,e_1).
% 1.65/1.87 ** KEPT (pick-wt=3): 4 [] -e_qualish(e_2,e_3).
% 1.65/1.87 ** KEPT (pick-wt=3): 5 [] -e_qualish(e_3,e_1).
% 1.65/1.87 ** KEPT (pick-wt=3): 6 [] -e_qualish(e_3,e_2).
% 1.65/1.87 ** KEPT (pick-wt=16): 7 [] -group_element(A)| -group_element(B)|product(A,B,e_1)|product(A,B,e_2)|product(A,B,e_3).
% 1.65/1.87 ** KEPT (pick-wt=11): 8 [] -product(A,B,C)| -product(A,B,D)|e_qualish(C,D).
% 1.65/1.87 ** KEPT (pick-wt=11): 9 [] -product(A,B,C)| -product(A,D,C)|e_qualish(B,D).
% 1.65/1.87 ** KEPT (pick-wt=11): 10 [] -product(A,B,C)| -product(D,B,C)|e_qualish(A,D).
% 1.65/1.87 ** KEPT (pick-wt=19): 11 [] -product(A,B,C)| -product(D,E,C)| -product(F,B,A)| -product(F,E,D)|e_qualish(A,D).
% 1.65/1.87 ** KEPT (pick-wt=19): 12 [] -product(A,B,C)| -product(D,E,C)| -product(F,B,A)| -product(F,E,D)|e_qualish(B,E).
% 1.65/1.87
% 1.65/1.87 ------------> process sos:
% 1.65/1.87 ** KEPT (pick-wt=2): 21 [] group_element(e_1).
% 1.65/1.87 ** KEPT (pick-wt=2): 22 [] group_element(e_2).
% 1.65/1.87 ** KEPT (pick-wt=2): 23 [] group_element(e_3).
% 1.65/1.87 ** KEPT (pick-wt=4): 24 [] product(A,A,A).
% 1.65/1.87
% 1.65/1.87 ======= end of input processing =======
% 1.65/1.87
% 1.65/1.87 =========== start of search ===========
% 1.65/1.87
% 1.65/1.87 -------- PROOF --------
% 1.65/1.87
% 1.65/1.87 ----> UNIT CONFLICT at 0.02 sec ----> 50 [binary,49.1,5.1] $F.
% 1.65/1.87
% 1.65/1.87 Length of proof is 8. Level of proof is 5.
% 1.65/1.87
% 1.65/1.87 ---------------- PROOF ----------------
% 1.65/1.87 % SZS status Unsatisfiable
% 1.65/1.87 % SZS output start Refutation
% See solution above
% 1.65/1.87 ------------ end of proof -------------
% 1.65/1.87
% 1.65/1.87
% 1.65/1.87 Search stopped by max_proofs option.
% 1.65/1.87
% 1.65/1.87
% 1.65/1.87 Search stopped by max_proofs option.
% 1.65/1.87
% 1.65/1.87 ============ end of search ============
% 1.65/1.87
% 1.65/1.87 -------------- statistics -------------
% 1.65/1.87 clauses given 18
% 1.65/1.87 clauses generated 904
% 1.65/1.87 clauses kept 49
% 1.65/1.87 clauses forward subsumed 871
% 1.65/1.87 clauses back subsumed 17
% 1.65/1.87 Kbytes malloced 976
% 1.65/1.87
% 1.65/1.87 ----------- times (seconds) -----------
% 1.65/1.87 user CPU time 0.02 (0 hr, 0 min, 0 sec)
% 1.65/1.87 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.65/1.87 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.65/1.87
% 1.65/1.87 That finishes the proof of the theorem.
% 1.65/1.87
% 1.65/1.87 Process 4154 finished Wed Jul 27 05:07:15 2022
% 1.65/1.87 Otter interrupted
% 1.65/1.87 PROOF FOUND
%------------------------------------------------------------------------------