TSTP Solution File: COL064-5 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : COL064-5 : TPTP v8.1.0. Bugfixed v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n028.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:48:09 EDT 2022
% Result : Unsatisfiable 1.66s 1.87s
% Output : Refutation 1.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of clauses : 11 ( 11 unt; 0 nHn; 4 RR)
% Number of literals : 11 ( 10 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 11 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 19 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
apply(apply(apply(apply(apply(b,apply(apply(b,apply(t,apply(apply(b,b),t))),apply(apply(b,b),b))),t),x),y),z) != apply(apply(z,x),y),
file('COL064-5.p',unknown),
[] ).
cnf(4,axiom,
apply(apply(apply(b,A),B),C) = apply(A,apply(B,C)),
file('COL064-5.p',unknown),
[] ).
cnf(5,axiom,
apply(apply(t,A),B) = apply(B,A),
file('COL064-5.p',unknown),
[] ).
cnf(6,plain,
apply(apply(apply(apply(t,apply(apply(b,b),t)),apply(b,apply(b,apply(t,x)))),y),z) != apply(apply(z,x),y),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[1]),4,4,4]),
[iquote('back_demod,1,demod,4,4,4')] ).
cnf(7,plain,
apply(A,B) = apply(apply(t,B),A),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[5])]),
[iquote('copy,5,flip.1')] ).
cnf(21,plain,
apply(apply(apply(t,A),apply(b,B)),C) = apply(B,apply(A,C)),
inference(para_into,[status(thm),theory(equality)],[4,7]),
[iquote('para_into,3.1.1.1,7.1.1')] ).
cnf(22,plain,
apply(apply(t,A),apply(apply(b,B),C)) = apply(B,apply(C,A)),
inference(para_into,[status(thm),theory(equality)],[4,7]),
[iquote('para_into,3.1.1,7.1.1')] ).
cnf(23,plain,
apply(apply(z,x),y) != apply(apply(t,x),apply(apply(b,apply(t,y)),z)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[6]),21,4,4])]),
[iquote('back_demod,6,demod,21,4,4,flip.1')] ).
cnf(24,plain,
apply(A,apply(B,C)) = apply(apply(t,C),apply(apply(b,A),B)),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[22])]),
[iquote('copy,22,flip.1')] ).
cnf(53,plain,
apply(apply(A,B),C) = apply(apply(t,B),apply(apply(b,apply(t,C)),A)),
inference(para_into,[status(thm),theory(equality)],[24,5]),
[iquote('para_into,24.1.1,5.1.1')] ).
cnf(54,plain,
$false,
inference(binary,[status(thm)],[53,23]),
[iquote('binary,53.1,23.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : COL064-5 : TPTP v8.1.0. Bugfixed v1.2.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.13/0.33 % Computer : n028.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Wed Jul 27 02:33:03 EDT 2022
% 0.13/0.33 % CPUTime :
% 1.66/1.87 ----- Otter 3.3f, August 2004 -----
% 1.66/1.87 The process was started by sandbox on n028.cluster.edu,
% 1.66/1.87 Wed Jul 27 02:33:03 2022
% 1.66/1.87 The command was "./otter". The process ID is 14112.
% 1.66/1.87
% 1.66/1.87 set(prolog_style_variables).
% 1.66/1.87 set(auto).
% 1.66/1.87 dependent: set(auto1).
% 1.66/1.87 dependent: set(process_input).
% 1.66/1.87 dependent: clear(print_kept).
% 1.66/1.87 dependent: clear(print_new_demod).
% 1.66/1.87 dependent: clear(print_back_demod).
% 1.66/1.87 dependent: clear(print_back_sub).
% 1.66/1.87 dependent: set(control_memory).
% 1.66/1.87 dependent: assign(max_mem, 12000).
% 1.66/1.87 dependent: assign(pick_given_ratio, 4).
% 1.66/1.87 dependent: assign(stats_level, 1).
% 1.66/1.87 dependent: assign(max_seconds, 10800).
% 1.66/1.87 clear(print_given).
% 1.66/1.87
% 1.66/1.87 list(usable).
% 1.66/1.87 0 [] A=A.
% 1.66/1.87 0 [] apply(apply(apply(b,X),Y),Z)=apply(X,apply(Y,Z)).
% 1.66/1.87 0 [] apply(apply(t,X),Y)=apply(Y,X).
% 1.66/1.87 0 [] apply(apply(apply(apply(apply(b,apply(apply(b,apply(t,apply(apply(b,b),t))),apply(apply(b,b),b))),t),x),y),z)!=apply(apply(z,x),y).
% 1.66/1.87 end_of_list.
% 1.66/1.87
% 1.66/1.87 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 1.66/1.87
% 1.66/1.87 All clauses are units, and equality is present; the
% 1.66/1.87 strategy will be Knuth-Bendix with positive clauses in sos.
% 1.66/1.87
% 1.66/1.87 dependent: set(knuth_bendix).
% 1.66/1.87 dependent: set(anl_eq).
% 1.66/1.87 dependent: set(para_from).
% 1.66/1.87 dependent: set(para_into).
% 1.66/1.87 dependent: clear(para_from_right).
% 1.66/1.87 dependent: clear(para_into_right).
% 1.66/1.87 dependent: set(para_from_vars).
% 1.66/1.87 dependent: set(eq_units_both_ways).
% 1.66/1.87 dependent: set(dynamic_demod_all).
% 1.66/1.87 dependent: set(dynamic_demod).
% 1.66/1.87 dependent: set(order_eq).
% 1.66/1.87 dependent: set(back_demod).
% 1.66/1.87 dependent: set(lrpo).
% 1.66/1.87
% 1.66/1.87 ------------> process usable:
% 1.66/1.87 ** KEPT (pick-wt=31): 1 [] apply(apply(apply(apply(apply(b,apply(apply(b,apply(t,apply(apply(b,b),t))),apply(apply(b,b),b))),t),x),y),z)!=apply(apply(z,x),y).
% 1.66/1.87
% 1.66/1.87 ------------> process sos:
% 1.66/1.87 ** KEPT (pick-wt=3): 2 [] A=A.
% 1.66/1.87 ** KEPT (pick-wt=13): 3 [] apply(apply(apply(b,A),B),C)=apply(A,apply(B,C)).
% 1.66/1.87 ---> New Demodulator: 4 [new_demod,3] apply(apply(apply(b,A),B),C)=apply(A,apply(B,C)).
% 1.66/1.87 ** KEPT (pick-wt=9): 5 [] apply(apply(t,A),B)=apply(B,A).
% 1.66/1.87 Following clause subsumed by 2 during input processing: 0 [copy,2,flip.1] A=A.
% 1.66/1.87 >>>> Starting back demodulation with 4.
% 1.66/1.87 >> back demodulating 1 with 4.
% 1.66/1.87 ** KEPT (pick-wt=9): 7 [copy,5,flip.1] apply(A,B)=apply(apply(t,B),A).
% 1.66/1.87 Following clause subsumed by 5 during input processing: 0 [copy,7,flip.1] apply(apply(t,A),B)=apply(B,A).
% 1.66/1.87
% 1.66/1.87 ======= end of input processing =======
% 1.66/1.87
% 1.66/1.87 =========== start of search ===========
% 1.66/1.87
% 1.66/1.87 -------- PROOF --------
% 1.66/1.87
% 1.66/1.87 ----> UNIT CONFLICT at 0.00 sec ----> 54 [binary,53.1,23.1] $F.
% 1.66/1.87
% 1.66/1.87 Length of proof is 7. Level of proof is 4.
% 1.66/1.87
% 1.66/1.87 ---------------- PROOF ----------------
% 1.66/1.87 % SZS status Unsatisfiable
% 1.66/1.87 % SZS output start Refutation
% See solution above
% 1.66/1.87 ------------ end of proof -------------
% 1.66/1.87
% 1.66/1.87
% 1.66/1.87 Search stopped by max_proofs option.
% 1.66/1.87
% 1.66/1.87
% 1.66/1.87 Search stopped by max_proofs option.
% 1.66/1.87
% 1.66/1.87 ============ end of search ============
% 1.66/1.87
% 1.66/1.87 -------------- statistics -------------
% 1.66/1.87 clauses given 13
% 1.66/1.87 clauses generated 95
% 1.66/1.87 clauses kept 43
% 1.66/1.87 clauses forward subsumed 77
% 1.66/1.87 clauses back subsumed 0
% 1.66/1.87 Kbytes malloced 976
% 1.66/1.87
% 1.66/1.87 ----------- times (seconds) -----------
% 1.66/1.87 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.66/1.87 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.66/1.87 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.66/1.87
% 1.66/1.87 That finishes the proof of the theorem.
% 1.66/1.87
% 1.66/1.87 Process 14112 finished Wed Jul 27 02:33:05 2022
% 1.66/1.87 Otter interrupted
% 1.66/1.87 PROOF FOUND
%------------------------------------------------------------------------------