TSTP Solution File: GRP141-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : GRP141-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n003.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:32 EDT 2022
% Result : Unsatisfiable 1.61s 1.82s
% Output : Refutation 1.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 18 ( 18 unt; 0 nHn; 12 RR)
% Number of literals : 18 ( 17 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 13 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
greatest_lower_bound(greatest_lower_bound(a,b),c) != c,
file('GRP141-1.p',unknown),
[] ).
cnf(2,axiom,
A = A,
file('GRP141-1.p',unknown),
[] ).
cnf(9,axiom,
greatest_lower_bound(A,B) = greatest_lower_bound(B,A),
file('GRP141-1.p',unknown),
[] ).
cnf(10,axiom,
least_upper_bound(A,B) = least_upper_bound(B,A),
file('GRP141-1.p',unknown),
[] ).
cnf(11,axiom,
greatest_lower_bound(A,greatest_lower_bound(B,C)) = greatest_lower_bound(greatest_lower_bound(A,B),C),
file('GRP141-1.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(23,axiom,
greatest_lower_bound(A,least_upper_bound(A,B)) = A,
file('GRP141-1.p',unknown),
[] ).
cnf(33,axiom,
least_upper_bound(a,c) = a,
file('GRP141-1.p',unknown),
[] ).
cnf(35,axiom,
least_upper_bound(b,c) = b,
file('GRP141-1.p',unknown),
[] ).
cnf(37,plain,
greatest_lower_bound(a,greatest_lower_bound(b,c)) != c,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[1]),13]),
[iquote('back_demod,1,demod,13')] ).
cnf(38,plain,
least_upper_bound(c,b) = b,
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[10,35])]),
[iquote('para_into,10.1.1,35.1.1,flip.1')] ).
cnf(40,plain,
least_upper_bound(c,a) = a,
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[10,33])]),
[iquote('para_into,10.1.1,33.1.1,flip.1')] ).
cnf(48,plain,
greatest_lower_bound(c,a) = c,
inference(para_into,[status(thm),theory(equality)],[23,40]),
[iquote('para_into,23.1.1.2,40.1.1')] ).
cnf(50,plain,
greatest_lower_bound(c,b) = c,
inference(para_into,[status(thm),theory(equality)],[23,38]),
[iquote('para_into,23.1.1.2,38.1.1')] ).
cnf(57,plain,
greatest_lower_bound(a,c) = c,
inference(para_into,[status(thm),theory(equality)],[48,9]),
[iquote('para_into,48.1.1,9.1.1')] ).
cnf(74,plain,
greatest_lower_bound(b,c) = c,
inference(para_into,[status(thm),theory(equality)],[50,9]),
[iquote('para_into,50.1.1,9.1.1')] ).
cnf(75,plain,
c != c,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[37]),74,57]),
[iquote('back_demod,37,demod,74,57')] ).
cnf(76,plain,
$false,
inference(binary,[status(thm)],[75,2]),
[iquote('binary,75.1,2.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP141-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.13/0.13 % Command : otter-tptp-script %s
% 0.13/0.34 % Computer : n003.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Wed Jul 27 05:19:56 EDT 2022
% 0.13/0.35 % CPUTime :
% 1.61/1.82 ----- Otter 3.3f, August 2004 -----
% 1.61/1.82 The process was started by sandbox on n003.cluster.edu,
% 1.61/1.82 Wed Jul 27 05:19:56 2022
% 1.61/1.82 The command was "./otter". The process ID is 9093.
% 1.61/1.82
% 1.61/1.82 set(prolog_style_variables).
% 1.61/1.82 set(auto).
% 1.61/1.82 dependent: set(auto1).
% 1.61/1.82 dependent: set(process_input).
% 1.61/1.82 dependent: clear(print_kept).
% 1.61/1.82 dependent: clear(print_new_demod).
% 1.61/1.82 dependent: clear(print_back_demod).
% 1.61/1.82 dependent: clear(print_back_sub).
% 1.61/1.82 dependent: set(control_memory).
% 1.61/1.82 dependent: assign(max_mem, 12000).
% 1.61/1.82 dependent: assign(pick_given_ratio, 4).
% 1.61/1.82 dependent: assign(stats_level, 1).
% 1.61/1.82 dependent: assign(max_seconds, 10800).
% 1.61/1.82 clear(print_given).
% 1.61/1.82
% 1.61/1.82 list(usable).
% 1.61/1.82 0 [] A=A.
% 1.61/1.82 0 [] multiply(identity,X)=X.
% 1.61/1.82 0 [] multiply(inverse(X),X)=identity.
% 1.61/1.82 0 [] multiply(multiply(X,Y),Z)=multiply(X,multiply(Y,Z)).
% 1.61/1.82 0 [] greatest_lower_bound(X,Y)=greatest_lower_bound(Y,X).
% 1.61/1.82 0 [] least_upper_bound(X,Y)=least_upper_bound(Y,X).
% 1.61/1.82 0 [] greatest_lower_bound(X,greatest_lower_bound(Y,Z))=greatest_lower_bound(greatest_lower_bound(X,Y),Z).
% 1.61/1.82 0 [] least_upper_bound(X,least_upper_bound(Y,Z))=least_upper_bound(least_upper_bound(X,Y),Z).
% 1.61/1.82 0 [] least_upper_bound(X,X)=X.
% 1.61/1.82 0 [] greatest_lower_bound(X,X)=X.
% 1.61/1.82 0 [] least_upper_bound(X,greatest_lower_bound(X,Y))=X.
% 1.61/1.82 0 [] greatest_lower_bound(X,least_upper_bound(X,Y))=X.
% 1.61/1.82 0 [] multiply(X,least_upper_bound(Y,Z))=least_upper_bound(multiply(X,Y),multiply(X,Z)).
% 1.61/1.82 0 [] multiply(X,greatest_lower_bound(Y,Z))=greatest_lower_bound(multiply(X,Y),multiply(X,Z)).
% 1.61/1.82 0 [] multiply(least_upper_bound(Y,Z),X)=least_upper_bound(multiply(Y,X),multiply(Z,X)).
% 1.61/1.82 0 [] multiply(greatest_lower_bound(Y,Z),X)=greatest_lower_bound(multiply(Y,X),multiply(Z,X)).
% 1.61/1.82 0 [] least_upper_bound(a,c)=a.
% 1.61/1.82 0 [] least_upper_bound(b,c)=b.
% 1.61/1.82 0 [] greatest_lower_bound(greatest_lower_bound(a,b),c)!=c.
% 1.61/1.82 end_of_list.
% 1.61/1.82
% 1.61/1.82 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 1.61/1.82
% 1.61/1.82 All clauses are units, and equality is present; the
% 1.61/1.82 strategy will be Knuth-Bendix with positive clauses in sos.
% 1.61/1.82
% 1.61/1.82 dependent: set(knuth_bendix).
% 1.61/1.82 dependent: set(anl_eq).
% 1.61/1.82 dependent: set(para_from).
% 1.61/1.82 dependent: set(para_into).
% 1.61/1.82 dependent: clear(para_from_right).
% 1.61/1.82 dependent: clear(para_into_right).
% 1.61/1.82 dependent: set(para_from_vars).
% 1.61/1.82 dependent: set(eq_units_both_ways).
% 1.61/1.82 dependent: set(dynamic_demod_all).
% 1.61/1.82 dependent: set(dynamic_demod).
% 1.61/1.82 dependent: set(order_eq).
% 1.61/1.82 dependent: set(back_demod).
% 1.61/1.82 dependent: set(lrpo).
% 1.61/1.82
% 1.61/1.82 ------------> process usable:
% 1.61/1.82 ** KEPT (pick-wt=7): 1 [] greatest_lower_bound(greatest_lower_bound(a,b),c)!=c.
% 1.61/1.82
% 1.61/1.82 ------------> process sos:
% 1.61/1.82 ** KEPT (pick-wt=3): 2 [] A=A.
% 1.61/1.82 ** KEPT (pick-wt=5): 3 [] multiply(identity,A)=A.
% 1.61/1.82 ---> New Demodulator: 4 [new_demod,3] multiply(identity,A)=A.
% 1.61/1.82 ** KEPT (pick-wt=6): 5 [] multiply(inverse(A),A)=identity.
% 1.61/1.82 ---> New Demodulator: 6 [new_demod,5] multiply(inverse(A),A)=identity.
% 1.61/1.82 ** KEPT (pick-wt=11): 7 [] multiply(multiply(A,B),C)=multiply(A,multiply(B,C)).
% 1.61/1.82 ---> New Demodulator: 8 [new_demod,7] multiply(multiply(A,B),C)=multiply(A,multiply(B,C)).
% 1.61/1.82 ** KEPT (pick-wt=7): 9 [] greatest_lower_bound(A,B)=greatest_lower_bound(B,A).
% 1.61/1.82 ** KEPT (pick-wt=7): 10 [] least_upper_bound(A,B)=least_upper_bound(B,A).
% 1.61/1.82 ** 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.61/1.82 ---> 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.61/1.82 ** 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.61/1.82 ---> 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.61/1.82 ** KEPT (pick-wt=5): 17 [] least_upper_bound(A,A)=A.
% 1.61/1.82 ---> New Demodulator: 18 [new_demod,17] least_upper_bound(A,A)=A.
% 1.61/1.82 ** KEPT (pick-wt=5): 19 [] greatest_lower_bound(A,A)=A.
% 1.61/1.82 ---> New Demodulator: 20 [new_demod,19] greatest_lower_bound(A,A)=A.
% 1.61/1.82 ** KEPT (pick-wt=7): 21 [] least_upper_bound(A,greatest_lower_bound(A,B))=A.
% 1.61/1.82 ---> New Demodulator: 22 [new_demod,21] least_upper_bound(A,greatest_lower_bound(A,B))=A.
% 1.61/1.82 ** KEPT (pick-wt=7): 23 [] greatest_lower_bound(A,least_upper_bound(A,B))=A.
% 1.61/1.82 ---> New Demodulator: 24 [new_demod,23] greatest_lower_bound(A,least_upper_bound(A,B))=A.
% 1.61/1.82 ** KEPT (pick-wt=13): 25 [] multiply(A,least_upper_bound(B,C))=least_upper_bound(multiply(A,B),multiply(A,C)).
% 1.61/1.82 ---> New Demodulator: 26 [new_demod,25] multiply(A,least_upper_bound(B,C))=least_upper_bound(multiply(A,B),multiply(A,C)).
% 1.61/1.82 ** KEPT (pick-wt=13): 27 [] multiply(A,greatest_lower_bound(B,C))=greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 1.61/1.82 ---> New Demodulator: 28 [new_demod,27] multiply(A,greatest_lower_bound(B,C))=greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 1.61/1.82 ** KEPT (pick-wt=13): 29 [] multiply(least_upper_bound(A,B),C)=least_upper_bound(multiply(A,C),multiply(B,C)).
% 1.61/1.82 ---> New Demodulator: 30 [new_demod,29] multiply(least_upper_bound(A,B),C)=least_upper_bound(multiply(A,C),multiply(B,C)).
% 1.61/1.82 ** KEPT (pick-wt=13): 31 [] multiply(greatest_lower_bound(A,B),C)=greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 1.61/1.82 ---> New Demodulator: 32 [new_demod,31] multiply(greatest_lower_bound(A,B),C)=greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 1.61/1.82 ** KEPT (pick-wt=5): 33 [] least_upper_bound(a,c)=a.
% 1.61/1.82 ---> New Demodulator: 34 [new_demod,33] least_upper_bound(a,c)=a.
% 1.61/1.82 ** KEPT (pick-wt=5): 35 [] least_upper_bound(b,c)=b.
% 1.61/1.82 ---> New Demodulator: 36 [new_demod,35] least_upper_bound(b,c)=b.
% 1.61/1.82 Following clause subsumed by 2 during input processing: 0 [copy,2,flip.1] A=A.
% 1.61/1.82 >>>> Starting back demodulation with 4.
% 1.61/1.82 >>>> Starting back demodulation with 6.
% 1.61/1.82 >>>> Starting back demodulation with 8.
% 1.61/1.82 Following clause subsumed by 9 during input processing: 0 [copy,9,flip.1] greatest_lower_bound(A,B)=greatest_lower_bound(B,A).
% 1.61/1.82 Following clause subsumed by 10 during input processing: 0 [copy,10,flip.1] least_upper_bound(A,B)=least_upper_bound(B,A).
% 1.61/1.82 >>>> Starting back demodulation with 13.
% 1.61/1.82 >> back demodulating 1 with 13.
% 1.61/1.82 >>>> Starting back demodulation with 16.
% 1.61/1.82 >>>> Starting back demodulation with 18.
% 1.61/1.82 >>>> Starting back demodulation with 20.
% 1.61/1.82 >>>> Starting back demodulation with 22.
% 1.61/1.82 >>>> Starting back demodulation with 24.
% 1.61/1.82 >>>> Starting back demodulation with 26.
% 1.61/1.82 >>>> Starting back demodulation with 28.
% 1.61/1.82 >>>> Starting back demodulation with 30.
% 1.61/1.82 >>>> Starting back demodulation with 32.
% 1.61/1.82 >>>> Starting back demodulation with 34.
% 1.61/1.82 >>>> Starting back demodulation with 36.
% 1.61/1.82
% 1.61/1.82 ======= end of input processing =======
% 1.61/1.82
% 1.61/1.82 =========== start of search ===========
% 1.61/1.82
% 1.61/1.82 -------- PROOF --------
% 1.61/1.82
% 1.61/1.82 ----> UNIT CONFLICT at 0.00 sec ----> 76 [binary,75.1,2.1] $F.
% 1.61/1.82
% 1.61/1.82 Length of proof is 9. Level of proof is 4.
% 1.61/1.82
% 1.61/1.82 ---------------- PROOF ----------------
% 1.61/1.82 % SZS status Unsatisfiable
% 1.61/1.82 % SZS output start Refutation
% See solution above
% 1.61/1.82 ------------ end of proof -------------
% 1.61/1.82
% 1.61/1.82
% 1.61/1.82 Search stopped by max_proofs option.
% 1.61/1.82
% 1.61/1.82
% 1.61/1.82 Search stopped by max_proofs option.
% 1.61/1.82
% 1.61/1.82 ============ end of search ============
% 1.61/1.82
% 1.61/1.82 -------------- statistics -------------
% 1.61/1.82 clauses given 17
% 1.61/1.82 clauses generated 78
% 1.61/1.82 clauses kept 41
% 1.61/1.82 clauses forward subsumed 64
% 1.61/1.82 clauses back subsumed 0
% 1.61/1.82 Kbytes malloced 976
% 1.61/1.82
% 1.61/1.82 ----------- times (seconds) -----------
% 1.61/1.82 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.61/1.82 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.61/1.82 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.61/1.82
% 1.61/1.82 That finishes the proof of the theorem.
% 1.61/1.82
% 1.61/1.82 Process 9093 finished Wed Jul 27 05:19:58 2022
% 1.61/1.82 Otter interrupted
% 1.61/1.82 PROOF FOUND
%------------------------------------------------------------------------------