TSTP Solution File: GRP193-2 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : GRP193-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n026.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.93s 2.14s
% Output : Refutation 1.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 12
% Syntax : Number of clauses : 21 ( 21 unt; 0 nHn; 8 RR)
% Number of literals : 21 ( 20 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 28 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
greatest_lower_bound(a,multiply(b,c)) != greatest_lower_bound(a,c),
file('GRP193-2.p',unknown),
[] ).
cnf(4,axiom,
multiply(identity,A) = A,
file('GRP193-2.p',unknown),
[] ).
cnf(9,axiom,
greatest_lower_bound(A,B) = greatest_lower_bound(B,A),
file('GRP193-2.p',unknown),
[] ).
cnf(10,axiom,
least_upper_bound(A,B) = least_upper_bound(B,A),
file('GRP193-2.p',unknown),
[] ).
cnf(11,axiom,
greatest_lower_bound(A,greatest_lower_bound(B,C)) = greatest_lower_bound(greatest_lower_bound(A,B),C),
file('GRP193-2.p',unknown),
[] ).
cnf(13,plain,
greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[11])]),
[iquote('copy,11,flip.1')] ).
cnf(21,axiom,
least_upper_bound(A,greatest_lower_bound(A,B)) = A,
file('GRP193-2.p',unknown),
[] ).
cnf(23,axiom,
greatest_lower_bound(A,least_upper_bound(A,B)) = A,
file('GRP193-2.p',unknown),
[] ).
cnf(28,axiom,
multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)),
file('GRP193-2.p',unknown),
[] ).
cnf(31,axiom,
multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)),
file('GRP193-2.p',unknown),
[] ).
cnf(35,axiom,
greatest_lower_bound(identity,b) = identity,
file('GRP193-2.p',unknown),
[] ).
cnf(40,axiom,
greatest_lower_bound(a,b) = identity,
file('GRP193-2.p',unknown),
[] ).
cnf(41,axiom,
greatest_lower_bound(greatest_lower_bound(a,multiply(b,c)),multiply(greatest_lower_bound(a,b),greatest_lower_bound(a,c))) = greatest_lower_bound(a,multiply(b,c)),
file('GRP193-2.p',unknown),
[] ).
cnf(42,plain,
greatest_lower_bound(a,greatest_lower_bound(multiply(b,c),greatest_lower_bound(a,c))) = greatest_lower_bound(a,multiply(b,c)),
inference(demod,[status(thm),theory(equality)],[inference(copy,[status(thm)],[41]),40,28,4,4,13]),
[iquote('copy,41,demod,40,28,4,4,13')] ).
cnf(48,plain,
greatest_lower_bound(b,identity) = identity,
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[9,35])]),
[iquote('para_into,9.1.1,35.1.1,flip.1')] ).
cnf(63,plain,
least_upper_bound(greatest_lower_bound(A,B),A) = A,
inference(para_into,[status(thm),theory(equality)],[21,10]),
[iquote('para_into,21.1.1,10.1.1')] ).
cnf(148,plain,
greatest_lower_bound(A,greatest_lower_bound(B,A)) = greatest_lower_bound(A,B),
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[63,23]),13]),
[iquote('para_from,63.1.1,23.1.1.2,demod,13')] ).
cnf(315,plain,
greatest_lower_bound(multiply(b,A),A) = A,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[31,48]),4,4])]),
[iquote('para_into,31.1.1.1,48.1.1,demod,4,4,flip.1')] ).
cnf(354,plain,
greatest_lower_bound(multiply(b,A),greatest_lower_bound(A,B)) = greatest_lower_bound(A,B),
inference(flip,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[315,13])]),
[iquote('para_from,315.1.1,12.1.1.1,flip.1')] ).
cnf(365,plain,
greatest_lower_bound(a,multiply(b,c)) = greatest_lower_bound(a,c),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[42,9]),354,148])]),
[iquote('para_into,42.1.1.2.2,9.1.1,demod,354,148,flip.1')] ).
cnf(367,plain,
$false,
inference(binary,[status(thm)],[365,1]),
[iquote('binary,365.1,1.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP193-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.07/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n026.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:40:54 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.93/2.13 ----- Otter 3.3f, August 2004 -----
% 1.93/2.13 The process was started by sandbox on n026.cluster.edu,
% 1.93/2.13 Wed Jul 27 05:40:54 2022
% 1.93/2.13 The command was "./otter". The process ID is 24485.
% 1.93/2.13
% 1.93/2.13 set(prolog_style_variables).
% 1.93/2.13 set(auto).
% 1.93/2.13 dependent: set(auto1).
% 1.93/2.13 dependent: set(process_input).
% 1.93/2.13 dependent: clear(print_kept).
% 1.93/2.13 dependent: clear(print_new_demod).
% 1.93/2.13 dependent: clear(print_back_demod).
% 1.93/2.13 dependent: clear(print_back_sub).
% 1.93/2.13 dependent: set(control_memory).
% 1.93/2.13 dependent: assign(max_mem, 12000).
% 1.93/2.13 dependent: assign(pick_given_ratio, 4).
% 1.93/2.13 dependent: assign(stats_level, 1).
% 1.93/2.13 dependent: assign(max_seconds, 10800).
% 1.93/2.13 clear(print_given).
% 1.93/2.13
% 1.93/2.13 list(usable).
% 1.93/2.13 0 [] A=A.
% 1.93/2.13 0 [] multiply(identity,X)=X.
% 1.93/2.13 0 [] multiply(inverse(X),X)=identity.
% 1.93/2.13 0 [] multiply(multiply(X,Y),Z)=multiply(X,multiply(Y,Z)).
% 1.93/2.13 0 [] greatest_lower_bound(X,Y)=greatest_lower_bound(Y,X).
% 1.93/2.13 0 [] least_upper_bound(X,Y)=least_upper_bound(Y,X).
% 1.93/2.13 0 [] greatest_lower_bound(X,greatest_lower_bound(Y,Z))=greatest_lower_bound(greatest_lower_bound(X,Y),Z).
% 1.93/2.13 0 [] least_upper_bound(X,least_upper_bound(Y,Z))=least_upper_bound(least_upper_bound(X,Y),Z).
% 1.93/2.13 0 [] least_upper_bound(X,X)=X.
% 1.93/2.13 0 [] greatest_lower_bound(X,X)=X.
% 1.93/2.13 0 [] least_upper_bound(X,greatest_lower_bound(X,Y))=X.
% 1.93/2.13 0 [] greatest_lower_bound(X,least_upper_bound(X,Y))=X.
% 1.93/2.13 0 [] multiply(X,least_upper_bound(Y,Z))=least_upper_bound(multiply(X,Y),multiply(X,Z)).
% 1.93/2.13 0 [] multiply(X,greatest_lower_bound(Y,Z))=greatest_lower_bound(multiply(X,Y),multiply(X,Z)).
% 1.93/2.13 0 [] multiply(least_upper_bound(Y,Z),X)=least_upper_bound(multiply(Y,X),multiply(Z,X)).
% 1.93/2.13 0 [] multiply(greatest_lower_bound(Y,Z),X)=greatest_lower_bound(multiply(Y,X),multiply(Z,X)).
% 1.93/2.13 0 [] greatest_lower_bound(identity,a)=identity.
% 1.93/2.13 0 [] greatest_lower_bound(identity,b)=identity.
% 1.93/2.13 0 [] greatest_lower_bound(identity,c)=identity.
% 1.93/2.13 0 [] greatest_lower_bound(a,b)=identity.
% 1.93/2.13 0 [] greatest_lower_bound(greatest_lower_bound(a,multiply(b,c)),multiply(greatest_lower_bound(a,b),greatest_lower_bound(a,c)))=greatest_lower_bound(a,multiply(b,c)).
% 1.93/2.13 0 [] greatest_lower_bound(a,multiply(b,c))!=greatest_lower_bound(a,c).
% 1.93/2.13 end_of_list.
% 1.93/2.13
% 1.93/2.13 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 1.93/2.13
% 1.93/2.13 All clauses are units, and equality is present; the
% 1.93/2.13 strategy will be Knuth-Bendix with positive clauses in sos.
% 1.93/2.13
% 1.93/2.13 dependent: set(knuth_bendix).
% 1.93/2.13 dependent: set(anl_eq).
% 1.93/2.13 dependent: set(para_from).
% 1.93/2.13 dependent: set(para_into).
% 1.93/2.13 dependent: clear(para_from_right).
% 1.93/2.13 dependent: clear(para_into_right).
% 1.93/2.13 dependent: set(para_from_vars).
% 1.93/2.13 dependent: set(eq_units_both_ways).
% 1.93/2.13 dependent: set(dynamic_demod_all).
% 1.93/2.13 dependent: set(dynamic_demod).
% 1.93/2.13 dependent: set(order_eq).
% 1.93/2.13 dependent: set(back_demod).
% 1.93/2.13 dependent: set(lrpo).
% 1.93/2.13
% 1.93/2.13 ------------> process usable:
% 1.93/2.13 ** KEPT (pick-wt=9): 1 [] greatest_lower_bound(a,multiply(b,c))!=greatest_lower_bound(a,c).
% 1.93/2.13
% 1.93/2.13 ------------> process sos:
% 1.93/2.13 ** KEPT (pick-wt=3): 2 [] A=A.
% 1.93/2.13 ** KEPT (pick-wt=5): 3 [] multiply(identity,A)=A.
% 1.93/2.13 ---> New Demodulator: 4 [new_demod,3] multiply(identity,A)=A.
% 1.93/2.13 ** KEPT (pick-wt=6): 5 [] multiply(inverse(A),A)=identity.
% 1.93/2.13 ---> New Demodulator: 6 [new_demod,5] multiply(inverse(A),A)=identity.
% 1.93/2.13 ** KEPT (pick-wt=11): 7 [] multiply(multiply(A,B),C)=multiply(A,multiply(B,C)).
% 1.93/2.13 ---> New Demodulator: 8 [new_demod,7] multiply(multiply(A,B),C)=multiply(A,multiply(B,C)).
% 1.93/2.13 ** KEPT (pick-wt=7): 9 [] greatest_lower_bound(A,B)=greatest_lower_bound(B,A).
% 1.93/2.13 ** KEPT (pick-wt=7): 10 [] least_upper_bound(A,B)=least_upper_bound(B,A).
% 1.93/2.13 ** KEPT (pick-wt=11): 12 [copy,11,flip.1] greatest_lower_bound(greatest_lower_bound(A,B),C)=greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 1.93/2.13 ---> New Demodulator: 13 [new_demod,12] greatest_lower_bound(greatest_lower_bound(A,B),C)=greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 1.93/2.13 ** KEPT (pick-wt=11): 15 [copy,14,flip.1] least_upper_bound(least_upper_bound(A,B),C)=least_upper_bound(A,least_upper_bound(B,C)).
% 1.93/2.13 ---> New Demodulator: 16 [new_demod,15] least_upper_bound(least_upper_bound(A,B),C)=least_upper_bound(A,least_upper_bound(B,C)).
% 1.93/2.13 ** KEPT (pick-wt=5): 17 [] least_upper_bound(A,A)=A.
% 1.93/2.13 ---> New Demodulator: 18 [new_demod,17] least_upper_bound(A,A)=A.
% 1.93/2.13 ** KEPT (pick-wt=5): 19 [] greatest_lower_bound(A,A)=A.
% 1.93/2.13 ---> New Demodulator: 20 [new_demod,19] greatest_lower_bound(A,A)=A.
% 1.93/2.13 ** KEPT (pick-wt=7): 21 [] least_upper_bound(A,greatest_lower_bound(A,B))=A.
% 1.93/2.13 ---> New Demodulator: 22 [new_demod,21] least_upper_bound(A,greatest_lower_bound(A,B))=A.
% 1.93/2.13 ** KEPT (pick-wt=7): 23 [] greatest_lower_bound(A,least_upper_bound(A,B))=A.
% 1.93/2.13 ---> New Demodulator: 24 [new_demod,23] greatest_lower_bound(A,least_upper_bound(A,B))=A.
% 1.93/2.13 ** KEPT (pick-wt=13): 25 [] multiply(A,least_upper_bound(B,C))=least_upper_bound(multiply(A,B),multiply(A,C)).
% 1.93/2.13 ---> New Demodulator: 26 [new_demod,25] multiply(A,least_upper_bound(B,C))=least_upper_bound(multiply(A,B),multiply(A,C)).
% 1.93/2.13 ** KEPT (pick-wt=13): 27 [] multiply(A,greatest_lower_bound(B,C))=greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 1.93/2.13 ---> New Demodulator: 28 [new_demod,27] multiply(A,greatest_lower_bound(B,C))=greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 1.93/2.13 ** KEPT (pick-wt=13): 29 [] multiply(least_upper_bound(A,B),C)=least_upper_bound(multiply(A,C),multiply(B,C)).
% 1.93/2.14 ---> New Demodulator: 30 [new_demod,29] multiply(least_upper_bound(A,B),C)=least_upper_bound(multiply(A,C),multiply(B,C)).
% 1.93/2.14 ** KEPT (pick-wt=13): 31 [] multiply(greatest_lower_bound(A,B),C)=greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 1.93/2.14 ---> New Demodulator: 32 [new_demod,31] multiply(greatest_lower_bound(A,B),C)=greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 1.93/2.14 ** KEPT (pick-wt=5): 33 [] greatest_lower_bound(identity,a)=identity.
% 1.93/2.14 ---> New Demodulator: 34 [new_demod,33] greatest_lower_bound(identity,a)=identity.
% 1.93/2.14 ** KEPT (pick-wt=5): 35 [] greatest_lower_bound(identity,b)=identity.
% 1.93/2.14 ---> New Demodulator: 36 [new_demod,35] greatest_lower_bound(identity,b)=identity.
% 1.93/2.14 ** KEPT (pick-wt=5): 37 [] greatest_lower_bound(identity,c)=identity.
% 1.93/2.14 ---> New Demodulator: 38 [new_demod,37] greatest_lower_bound(identity,c)=identity.
% 1.93/2.14 ** KEPT (pick-wt=5): 39 [] greatest_lower_bound(a,b)=identity.
% 1.93/2.14 ---> New Demodulator: 40 [new_demod,39] greatest_lower_bound(a,b)=identity.
% 1.93/2.14 ** KEPT (pick-wt=15): 42 [copy,41,demod,40,28,4,4,13] greatest_lower_bound(a,greatest_lower_bound(multiply(b,c),greatest_lower_bound(a,c)))=greatest_lower_bound(a,multiply(b,c)).
% 1.93/2.14 ---> New Demodulator: 43 [new_demod,42] greatest_lower_bound(a,greatest_lower_bound(multiply(b,c),greatest_lower_bound(a,c)))=greatest_lower_bound(a,multiply(b,c)).
% 1.93/2.14 Following clause subsumed by 2 during input processing: 0 [copy,2,flip.1] A=A.
% 1.93/2.14 >>>> Starting back demodulation with 4.
% 1.93/2.14 >>>> Starting back demodulation with 6.
% 1.93/2.14 >>>> Starting back demodulation with 8.
% 1.93/2.14 Following clause subsumed by 9 during input processing: 0 [copy,9,flip.1] greatest_lower_bound(A,B)=greatest_lower_bound(B,A).
% 1.93/2.14 Following clause subsumed by 10 during input processing: 0 [copy,10,flip.1] least_upper_bound(A,B)=least_upper_bound(B,A).
% 1.93/2.14 >>>> Starting back demodulation with 13.
% 1.93/2.14 >>>> Starting back demodulation with 16.
% 1.93/2.14 >>>> Starting back demodulation with 18.
% 1.93/2.14 >>>> Starting back demodulation with 20.
% 1.93/2.14 >>>> Starting back demodulation with 22.
% 1.93/2.14 >>>> Starting back demodulation with 24.
% 1.93/2.14 >>>> Starting back demodulation with 26.
% 1.93/2.14 >>>> Starting back demodulation with 28.
% 1.93/2.14 >>>> Starting back demodulation with 30.
% 1.93/2.14 >>>> Starting back demodulation with 32.
% 1.93/2.14 >>>> Starting back demodulation with 34.
% 1.93/2.14 >>>> Starting back demodulation with 36.
% 1.93/2.14 >>>> Starting back demodulation with 38.
% 1.93/2.14 >>>> Starting back demodulation with 40.
% 1.93/2.14 >>>> Starting back demodulation with 43.
% 1.93/2.14
% 1.93/2.14 ======= end of input processing =======
% 1.93/2.14
% 1.93/2.14 =========== start of search ===========
% 1.93/2.14
% 1.93/2.14 -------- PROOF --------
% 1.93/2.14
% 1.93/2.14 ----> UNIT CONFLICT at 0.01 sec ----> 367 [binary,365.1,1.1] $F.
% 1.93/2.14
% 1.93/2.14 Length of proof is 8. Level of proof is 4.
% 1.93/2.14
% 1.93/2.14 ---------------- PROOF ----------------
% 1.93/2.14 % SZS status Unsatisfiable
% 1.93/2.14 % SZS output start Refutation
% See solution above
% 1.93/2.14 ------------ end of proof -------------
% 1.93/2.14
% 1.93/2.14
% 1.93/2.14 Search stopped by max_proofs option.
% 1.93/2.14
% 1.93/2.14
% 1.93/2.14 Search stopped by max_proofs option.
% 1.93/2.14
% 1.93/2.14 ============ end of search ============
% 1.93/2.14
% 1.93/2.14 -------------- statistics -------------
% 1.93/2.14 clauses given 51
% 1.93/2.14 clauses generated 532
% 1.93/2.14 clauses kept 189
% 1.93/2.14 clauses forward subsumed 406
% 1.93/2.14 clauses back subsumed 1
% 1.93/2.14 Kbytes malloced 2929
% 1.93/2.14
% 1.93/2.14 ----------- times (seconds) -----------
% 1.93/2.14 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.93/2.14 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.93/2.14 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.93/2.14
% 1.93/2.14 That finishes the proof of the theorem.
% 1.93/2.14
% 1.93/2.14 Process 24485 finished Wed Jul 27 05:40:56 2022
% 1.93/2.14 Otter interrupted
% 1.93/2.14 PROOF FOUND
%------------------------------------------------------------------------------