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