TSTP Solution File: GRP195-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : GRP195-1 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n022.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:43 EDT 2022
% Result : Unsatisfiable 1.74s 1.94s
% Output : Refutation 1.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of clauses : 10 ( 10 unt; 0 nHn; 3 RR)
% Number of literals : 10 ( 9 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 8 ( 3 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 27 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
multiply(a,multiply(b,multiply(a,multiply(b,multiply(a,multiply(b,multiply(a,b))))))) != multiply(a,multiply(a,multiply(a,multiply(a,multiply(b,multiply(b,multiply(b,b))))))),
file('GRP195-1.p',unknown),
[] ).
cnf(4,axiom,
multiply(multiply(A,B),C) = multiply(A,multiply(B,C)),
file('GRP195-1.p',unknown),
[] ).
cnf(5,axiom,
multiply(A,multiply(B,B)) = multiply(B,multiply(B,A)),
file('GRP195-1.p',unknown),
[] ).
cnf(8,plain,
multiply(A,multiply(B,multiply(C,multiply(B,C)))) = multiply(B,multiply(C,multiply(B,multiply(C,A)))),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[5,4]),4,4]),
[iquote('para_into,5.1.1.2,3.1.1,demod,4,4')] ).
cnf(9,plain,
multiply(A,multiply(B,multiply(C,C))) = multiply(C,multiply(C,multiply(A,B))),
inference(para_into,[status(thm),theory(equality)],[5,4]),
[iquote('para_into,5.1.1,3.1.1')] ).
cnf(28,plain,
multiply(A,multiply(A,multiply(B,multiply(C,D)))) = multiply(B,multiply(C,multiply(A,multiply(A,D)))),
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[9,4]),4,4,4,4,4]),
[iquote('para_from,9.1.1,3.1.1.1,demod,4,4,4,4,4')] ).
cnf(48,plain,
multiply(a,multiply(b,multiply(a,multiply(a,multiply(b,multiply(a,multiply(b,b))))))) != multiply(a,multiply(a,multiply(a,multiply(a,multiply(b,multiply(b,multiply(b,b))))))),
inference(para_from,[status(thm),theory(equality)],[8,1]),
[iquote('para_from,8.1.1,1.1.1.2.2.2')] ).
cnf(557,plain,
multiply(A,multiply(A,multiply(B,multiply(C,multiply(D,multiply(E,multiply(E,F))))))) = multiply(B,multiply(E,multiply(A,multiply(A,multiply(E,multiply(C,multiply(D,F))))))),
inference(para_into,[status(thm),theory(equality)],[28,28]),
[iquote('para_into,28.1.1.2.2.2,28.1.1')] ).
cnf(595,plain,
multiply(A,multiply(B,multiply(C,multiply(C,multiply(B,multiply(D,multiply(E,F))))))) = multiply(C,multiply(C,multiply(A,multiply(D,multiply(E,multiply(B,multiply(B,F))))))),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[557])]),
[iquote('copy,557,flip.1')] ).
cnf(596,plain,
$false,
inference(binary,[status(thm)],[595,48]),
[iquote('binary,595.1,48.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP195-1 : TPTP v8.1.0. Released v2.2.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n022.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:05:20 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.74/1.94 ----- Otter 3.3f, August 2004 -----
% 1.74/1.94 The process was started by sandbox on n022.cluster.edu,
% 1.74/1.94 Wed Jul 27 05:05:20 2022
% 1.74/1.94 The command was "./otter". The process ID is 24203.
% 1.74/1.94
% 1.74/1.94 set(prolog_style_variables).
% 1.74/1.94 set(auto).
% 1.74/1.94 dependent: set(auto1).
% 1.74/1.94 dependent: set(process_input).
% 1.74/1.94 dependent: clear(print_kept).
% 1.74/1.94 dependent: clear(print_new_demod).
% 1.74/1.94 dependent: clear(print_back_demod).
% 1.74/1.94 dependent: clear(print_back_sub).
% 1.74/1.94 dependent: set(control_memory).
% 1.74/1.94 dependent: assign(max_mem, 12000).
% 1.74/1.94 dependent: assign(pick_given_ratio, 4).
% 1.74/1.94 dependent: assign(stats_level, 1).
% 1.74/1.94 dependent: assign(max_seconds, 10800).
% 1.74/1.94 clear(print_given).
% 1.74/1.94
% 1.74/1.94 list(usable).
% 1.74/1.94 0 [] A=A.
% 1.74/1.94 0 [] multiply(multiply(X,Y),Z)=multiply(X,multiply(Y,Z)).
% 1.74/1.94 0 [] multiply(X,multiply(Y,Y))=multiply(Y,multiply(Y,X)).
% 1.74/1.94 0 [] multiply(a,multiply(b,multiply(a,multiply(b,multiply(a,multiply(b,multiply(a,b)))))))!=multiply(a,multiply(a,multiply(a,multiply(a,multiply(b,multiply(b,multiply(b,b))))))).
% 1.74/1.94 end_of_list.
% 1.74/1.94
% 1.74/1.94 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 1.74/1.94
% 1.74/1.94 All clauses are units, and equality is present; the
% 1.74/1.94 strategy will be Knuth-Bendix with positive clauses in sos.
% 1.74/1.94
% 1.74/1.94 dependent: set(knuth_bendix).
% 1.74/1.94 dependent: set(anl_eq).
% 1.74/1.94 dependent: set(para_from).
% 1.74/1.94 dependent: set(para_into).
% 1.74/1.94 dependent: clear(para_from_right).
% 1.74/1.94 dependent: clear(para_into_right).
% 1.74/1.94 dependent: set(para_from_vars).
% 1.74/1.94 dependent: set(eq_units_both_ways).
% 1.74/1.94 dependent: set(dynamic_demod_all).
% 1.74/1.94 dependent: set(dynamic_demod).
% 1.74/1.94 dependent: set(order_eq).
% 1.74/1.94 dependent: set(back_demod).
% 1.74/1.94 dependent: set(lrpo).
% 1.74/1.94
% 1.74/1.94 ------------> process usable:
% 1.74/1.94 ** KEPT (pick-wt=31): 1 [] multiply(a,multiply(b,multiply(a,multiply(b,multiply(a,multiply(b,multiply(a,b)))))))!=multiply(a,multiply(a,multiply(a,multiply(a,multiply(b,multiply(b,multiply(b,b))))))).
% 1.74/1.94
% 1.74/1.94 ------------> process sos:
% 1.74/1.94 ** KEPT (pick-wt=3): 2 [] A=A.
% 1.74/1.94 ** KEPT (pick-wt=11): 3 [] multiply(multiply(A,B),C)=multiply(A,multiply(B,C)).
% 1.74/1.94 ---> New Demodulator: 4 [new_demod,3] multiply(multiply(A,B),C)=multiply(A,multiply(B,C)).
% 1.74/1.94 ** KEPT (pick-wt=11): 5 [] multiply(A,multiply(B,B))=multiply(B,multiply(B,A)).
% 1.74/1.94 Following clause subsumed by 2 during input processing: 0 [copy,2,flip.1] A=A.
% 1.74/1.94 >>>> Starting back demodulation with 4.
% 1.74/1.94 ** KEPT (pick-wt=11): 6 [copy,5,flip.1] multiply(A,multiply(A,B))=multiply(B,multiply(A,A)).
% 1.74/1.94 Following clause subsumed by 5 during input processing: 0 [copy,6,flip.1] multiply(A,multiply(B,B))=multiply(B,multiply(B,A)).
% 1.74/1.94
% 1.74/1.94 ======= end of input processing =======
% 1.74/1.94
% 1.74/1.94 =========== start of search ===========
% 1.74/1.94
% 1.74/1.94 -------- PROOF --------
% 1.74/1.94
% 1.74/1.94 ----> UNIT CONFLICT at 0.05 sec ----> 596 [binary,595.1,48.1] $F.
% 1.74/1.94
% 1.74/1.94 Length of proof is 6. Level of proof is 4.
% 1.74/1.94
% 1.74/1.94 ---------------- PROOF ----------------
% 1.74/1.94 % SZS status Unsatisfiable
% 1.74/1.94 % SZS output start Refutation
% See solution above
% 1.74/1.94 ------------ end of proof -------------
% 1.74/1.94
% 1.74/1.94
% 1.74/1.94 Search stopped by max_proofs option.
% 1.74/1.94
% 1.74/1.94
% 1.74/1.94 Search stopped by max_proofs option.
% 1.74/1.94
% 1.74/1.94 ============ end of search ============
% 1.74/1.94
% 1.74/1.94 -------------- statistics -------------
% 1.74/1.94 clauses given 18
% 1.74/1.94 clauses generated 885
% 1.74/1.94 clauses kept 594
% 1.74/1.94 clauses forward subsumed 847
% 1.74/1.94 clauses back subsumed 33
% 1.74/1.94 Kbytes malloced 1953
% 1.74/1.94
% 1.74/1.94 ----------- times (seconds) -----------
% 1.74/1.94 user CPU time 0.05 (0 hr, 0 min, 0 sec)
% 1.74/1.94 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.74/1.94 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.74/1.94
% 1.74/1.94 That finishes the proof of the theorem.
% 1.74/1.94
% 1.74/1.94 Process 24203 finished Wed Jul 27 05:05:22 2022
% 1.74/1.94 Otter interrupted
% 1.74/1.94 PROOF FOUND
%------------------------------------------------------------------------------