TSTP Solution File: GRP036-3 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : GRP036-3 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n005.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:56 EDT 2022
% Result : Unsatisfiable 1.67s 1.86s
% Output : Refutation 1.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of clauses : 11 ( 8 unt; 0 nHn; 9 RR)
% Number of literals : 17 ( 3 equ; 7 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 13 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ product(A,B,C)
| ~ product(A,B,D)
| C = D ),
file('GRP036-3.p',unknown),
[] ).
cnf(3,axiom,
( ~ product(A,B,C)
| ~ product(B,D,E)
| ~ product(A,E,F)
| product(C,D,F) ),
file('GRP036-3.p',unknown),
[] ).
cnf(6,axiom,
( ~ subgroup_member(A)
| product(A,another_identity,A) ),
file('GRP036-3.p',unknown),
[] ).
cnf(10,axiom,
identity != another_identity,
file('GRP036-3.p',unknown),
[] ).
cnf(12,axiom,
product(identity,A,A),
file('GRP036-3.p',unknown),
[] ).
cnf(14,axiom,
product(inverse(A),A,identity),
file('GRP036-3.p',unknown),
[] ).
cnf(17,axiom,
subgroup_member(another_identity),
file('GRP036-3.p',unknown),
[] ).
cnf(21,plain,
product(another_identity,another_identity,another_identity),
inference(hyper,[status(thm)],[17,6]),
[iquote('hyper,17,6')] ).
cnf(41,plain,
product(identity,another_identity,identity),
inference(hyper,[status(thm)],[21,3,14,14]),
[iquote('hyper,21,3,14,14')] ).
cnf(62,plain,
identity = another_identity,
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[41,1,12])]),
[iquote('hyper,41,1,12,flip.1')] ).
cnf(64,plain,
$false,
inference(binary,[status(thm)],[62,10]),
[iquote('binary,62.1,10.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : GRP036-3 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n005.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.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Wed Jul 27 05:11:50 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.67/1.86 ----- Otter 3.3f, August 2004 -----
% 1.67/1.86 The process was started by sandbox on n005.cluster.edu,
% 1.67/1.86 Wed Jul 27 05:11:50 2022
% 1.67/1.86 The command was "./otter". The process ID is 27075.
% 1.67/1.86
% 1.67/1.86 set(prolog_style_variables).
% 1.67/1.86 set(auto).
% 1.67/1.86 dependent: set(auto1).
% 1.67/1.86 dependent: set(process_input).
% 1.67/1.86 dependent: clear(print_kept).
% 1.67/1.86 dependent: clear(print_new_demod).
% 1.67/1.86 dependent: clear(print_back_demod).
% 1.67/1.86 dependent: clear(print_back_sub).
% 1.67/1.86 dependent: set(control_memory).
% 1.67/1.86 dependent: assign(max_mem, 12000).
% 1.67/1.86 dependent: assign(pick_given_ratio, 4).
% 1.67/1.86 dependent: assign(stats_level, 1).
% 1.67/1.86 dependent: assign(max_seconds, 10800).
% 1.67/1.86 clear(print_given).
% 1.67/1.86
% 1.67/1.86 list(usable).
% 1.67/1.86 0 [] A=A.
% 1.67/1.86 0 [] product(identity,X,X).
% 1.67/1.86 0 [] product(X,identity,X).
% 1.67/1.86 0 [] product(inverse(X),X,identity).
% 1.67/1.86 0 [] product(X,inverse(X),identity).
% 1.67/1.86 0 [] product(X,Y,multiply(X,Y)).
% 1.67/1.86 0 [] -product(X,Y,Z)| -product(X,Y,W)|Z=W.
% 1.67/1.86 0 [] -product(X,Y,U)| -product(Y,Z,V)| -product(U,Z,W)|product(X,V,W).
% 1.67/1.86 0 [] -product(X,Y,U)| -product(Y,Z,V)| -product(X,V,W)|product(U,Z,W).
% 1.67/1.86 0 [] -subgroup_member(A)| -subgroup_member(B)| -product(A,inverse(B),C)|subgroup_member(C).
% 1.67/1.86 0 [] -subgroup_member(A)|product(another_identity,A,A).
% 1.67/1.86 0 [] -subgroup_member(A)|product(A,another_identity,A).
% 1.67/1.86 0 [] -subgroup_member(A)|product(A,another_inverse(A),another_identity).
% 1.67/1.86 0 [] -subgroup_member(A)|product(another_inverse(A),A,another_identity).
% 1.67/1.86 0 [] -subgroup_member(A)|subgroup_member(another_inverse(A)).
% 1.67/1.86 0 [] subgroup_member(another_identity).
% 1.67/1.86 0 [] identity!=another_identity.
% 1.67/1.86 end_of_list.
% 1.67/1.86
% 1.67/1.86 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=4.
% 1.67/1.86
% 1.67/1.86 This is a Horn set with equality. The strategy will be
% 1.67/1.86 Knuth-Bendix and hyper_res, with positive clauses in
% 1.67/1.86 sos and nonpositive clauses in usable.
% 1.67/1.86
% 1.67/1.86 dependent: set(knuth_bendix).
% 1.67/1.86 dependent: set(anl_eq).
% 1.67/1.86 dependent: set(para_from).
% 1.67/1.86 dependent: set(para_into).
% 1.67/1.86 dependent: clear(para_from_right).
% 1.67/1.86 dependent: clear(para_into_right).
% 1.67/1.86 dependent: set(para_from_vars).
% 1.67/1.86 dependent: set(eq_units_both_ways).
% 1.67/1.86 dependent: set(dynamic_demod_all).
% 1.67/1.86 dependent: set(dynamic_demod).
% 1.67/1.86 dependent: set(order_eq).
% 1.67/1.86 dependent: set(back_demod).
% 1.67/1.86 dependent: set(lrpo).
% 1.67/1.86 dependent: set(hyper_res).
% 1.67/1.86 dependent: clear(order_hyper).
% 1.67/1.86
% 1.67/1.86 ------------> process usable:
% 1.67/1.86 ** KEPT (pick-wt=11): 1 [] -product(A,B,C)| -product(A,B,D)|C=D.
% 1.67/1.86 ** KEPT (pick-wt=16): 2 [] -product(A,B,C)| -product(B,D,E)| -product(C,D,F)|product(A,E,F).
% 1.67/1.86 ** KEPT (pick-wt=16): 3 [] -product(A,B,C)| -product(B,D,E)| -product(A,E,F)|product(C,D,F).
% 1.67/1.86 ** KEPT (pick-wt=11): 4 [] -subgroup_member(A)| -subgroup_member(B)| -product(A,inverse(B),C)|subgroup_member(C).
% 1.67/1.86 ** KEPT (pick-wt=6): 5 [] -subgroup_member(A)|product(another_identity,A,A).
% 1.67/1.86 ** KEPT (pick-wt=6): 6 [] -subgroup_member(A)|product(A,another_identity,A).
% 1.67/1.86 ** KEPT (pick-wt=7): 7 [] -subgroup_member(A)|product(A,another_inverse(A),another_identity).
% 1.67/1.86 ** KEPT (pick-wt=7): 8 [] -subgroup_member(A)|product(another_inverse(A),A,another_identity).
% 1.67/1.86 ** KEPT (pick-wt=5): 9 [] -subgroup_member(A)|subgroup_member(another_inverse(A)).
% 1.67/1.86 ** KEPT (pick-wt=3): 10 [] identity!=another_identity.
% 1.67/1.86
% 1.67/1.86 ------------> process sos:
% 1.67/1.86 ** KEPT (pick-wt=3): 11 [] A=A.
% 1.67/1.86 ** KEPT (pick-wt=4): 12 [] product(identity,A,A).
% 1.67/1.86 ** KEPT (pick-wt=4): 13 [] product(A,identity,A).
% 1.67/1.86 ** KEPT (pick-wt=5): 14 [] product(inverse(A),A,identity).
% 1.67/1.86 ** KEPT (pick-wt=5): 15 [] product(A,inverse(A),identity).
% 1.67/1.86 ** KEPT (pick-wt=6): 16 [] product(A,B,multiply(A,B)).
% 1.67/1.86 ** KEPT (pick-wt=2): 17 [] subgroup_member(another_identity).
% 1.67/1.86 Following clause subsumed by 11 during input processing: 0 [copy,11,flip.1] A=A.
% 1.67/1.86
% 1.67/1.86 ======= end of input processing =======
% 1.67/1.86
% 1.67/1.86 =========== start of search ===========
% 1.67/1.86
% 1.67/1.86 -------- PROOF --------
% 1.67/1.86
% 1.67/1.86 ----> UNIT CONFLICT at 0.00 sec ----> 64 [binary,62.1,10.1] $F.
% 1.67/1.86
% 1.67/1.86 Length of proof is 3. Level of proof is 3.
% 1.67/1.86
% 1.67/1.86 ---------------- PROOF ----------------
% 1.67/1.86 % SZS status Unsatisfiable
% 1.67/1.86 % SZS output start Refutation
% See solution above
% 1.67/1.86 ------------ end of proof -------------
% 1.67/1.86
% 1.67/1.86
% 1.67/1.86 Search stopped by max_proofs option.
% 1.67/1.86
% 1.67/1.86
% 1.67/1.86 Search stopped by max_proofs option.
% 1.67/1.86
% 1.67/1.86 ============ end of search ============
% 1.67/1.86
% 1.67/1.86 -------------- statistics -------------
% 1.67/1.86 clauses given 10
% 1.67/1.86 clauses generated 158
% 1.67/1.86 clauses kept 61
% 1.67/1.86 clauses forward subsumed 117
% 1.67/1.86 clauses back subsumed 1
% 1.67/1.86 Kbytes malloced 976
% 1.67/1.86
% 1.67/1.86 ----------- times (seconds) -----------
% 1.67/1.86 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.67/1.86 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.67/1.86 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.67/1.86
% 1.67/1.86 That finishes the proof of the theorem.
% 1.67/1.86
% 1.67/1.86 Process 27075 finished Wed Jul 27 05:11:52 2022
% 1.67/1.86 Otter interrupted
% 1.67/1.86 PROOF FOUND
%------------------------------------------------------------------------------