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