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