TSTP Solution File: COL042-7 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : COL042-7 : TPTP v8.1.0. Released v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n016.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:03 EDT 2022
% Result : Unsatisfiable 1.93s 2.15s
% Output : Refutation 1.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of clauses : 17 ( 17 unt; 0 nHn; 5 RR)
% Number of literals : 17 ( 16 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 25 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
apply(strong_fixed_point,fixed_pt) != apply(fixed_pt,apply(strong_fixed_point,fixed_pt)),
file('COL042-7.p',unknown),
[] ).
cnf(2,plain,
apply(fixed_pt,apply(strong_fixed_point,fixed_pt)) != apply(strong_fixed_point,fixed_pt),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[1])]),
[iquote('copy,1,flip.1')] ).
cnf(5,axiom,
apply(apply(apply(b,A),B),C) = apply(A,apply(B,C)),
file('COL042-7.p',unknown),
[] ).
cnf(6,axiom,
apply(apply(w1,A),B) = apply(apply(B,A),A),
file('COL042-7.p',unknown),
[] ).
cnf(7,axiom,
strong_fixed_point = apply(apply(b,apply(apply(b,apply(w1,w1)),apply(b,w1))),apply(apply(b,b),b)),
file('COL042-7.p',unknown),
[] ).
cnf(8,plain,
apply(apply(b,apply(apply(b,apply(w1,w1)),apply(b,w1))),apply(apply(b,b),b)) = strong_fixed_point,
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[7])]),
[iquote('copy,7,flip.1')] ).
cnf(10,plain,
apply(apply(A,B),B) = apply(apply(w1,B),A),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[6])]),
[iquote('copy,6,flip.1')] ).
cnf(32,plain,
apply(apply(A,apply(B,C)),C) = apply(apply(w1,C),apply(apply(b,A),B)),
inference(para_from,[status(thm),theory(equality)],[5,10]),
[iquote('para_from,4.1.1,10.1.1.1')] ).
cnf(34,plain,
apply(apply(w1,A),apply(apply(b,B),C)) = apply(apply(B,apply(C,A)),A),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[32])]),
[iquote('copy,32,flip.1')] ).
cnf(100,plain,
apply(apply(w1,w1),apply(apply(b,w1),apply(b,apply(b,A)))) = apply(strong_fixed_point,A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[8,5]),5,5])]),
[iquote('para_from,8.1.1,4.1.1.1,demod,5,5,flip.1')] ).
cnf(371,plain,
apply(apply(A,apply(B,A)),apply(B,A)) = apply(apply(w1,A),apply(apply(b,w1),B)),
inference(para_into,[status(thm),theory(equality)],[32,6]),
[iquote('para_into,32.1.1,6.1.1')] ).
cnf(372,plain,
apply(A,apply(apply(B,C),C)) = apply(apply(w1,C),apply(apply(b,apply(b,A)),B)),
inference(para_into,[status(thm),theory(equality)],[32,5]),
[iquote('para_into,32.1.1,4.1.1')] ).
cnf(411,plain,
apply(apply(w1,A),apply(apply(b,apply(b,B)),C)) = apply(B,apply(apply(C,A),A)),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[372])]),
[iquote('copy,372,flip.1')] ).
cnf(680,plain,
apply(apply(w1,apply(apply(b,apply(b,A)),w1)),w1) = apply(strong_fixed_point,A),
inference(para_into,[status(thm),theory(equality)],[100,34]),
[iquote('para_into,99.1.1,34.1.1')] ).
cnf(708,plain,
apply(apply(w1,apply(apply(b,apply(b,A)),w1)),apply(apply(b,apply(b,A)),w1)) = apply(strong_fixed_point,A),
inference(para_into,[status(thm),theory(equality)],[680,6]),
[iquote('para_into,680.1.1,6.1.1')] ).
cnf(1544,plain,
apply(A,apply(strong_fixed_point,A)) = apply(strong_fixed_point,A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[411,371]),100,708])]),
[iquote('para_into,411.1.1,371.1.1,demod,100,708,flip.1')] ).
cnf(1546,plain,
$false,
inference(binary,[status(thm)],[1544,2]),
[iquote('binary,1544.1,2.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : COL042-7 : TPTP v8.1.0. Released v2.1.0.
% 0.11/0.13 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n016.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 02:45:07 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.93/2.15 ----- Otter 3.3f, August 2004 -----
% 1.93/2.15 The process was started by sandbox on n016.cluster.edu,
% 1.93/2.15 Wed Jul 27 02:45:07 2022
% 1.93/2.15 The command was "./otter". The process ID is 1133.
% 1.93/2.15
% 1.93/2.15 set(prolog_style_variables).
% 1.93/2.15 set(auto).
% 1.93/2.15 dependent: set(auto1).
% 1.93/2.15 dependent: set(process_input).
% 1.93/2.15 dependent: clear(print_kept).
% 1.93/2.15 dependent: clear(print_new_demod).
% 1.93/2.15 dependent: clear(print_back_demod).
% 1.93/2.15 dependent: clear(print_back_sub).
% 1.93/2.15 dependent: set(control_memory).
% 1.93/2.15 dependent: assign(max_mem, 12000).
% 1.93/2.15 dependent: assign(pick_given_ratio, 4).
% 1.93/2.15 dependent: assign(stats_level, 1).
% 1.93/2.15 dependent: assign(max_seconds, 10800).
% 1.93/2.15 clear(print_given).
% 1.93/2.15
% 1.93/2.15 list(usable).
% 1.93/2.15 0 [] A=A.
% 1.93/2.15 0 [] apply(apply(apply(b,X),Y),Z)=apply(X,apply(Y,Z)).
% 1.93/2.15 0 [] apply(apply(w1,X),Y)=apply(apply(Y,X),X).
% 1.93/2.15 0 [] strong_fixed_point=apply(apply(b,apply(apply(b,apply(w1,w1)),apply(b,w1))),apply(apply(b,b),b)).
% 1.93/2.15 0 [] apply(strong_fixed_point,fixed_pt)!=apply(fixed_pt,apply(strong_fixed_point,fixed_pt)).
% 1.93/2.15 end_of_list.
% 1.93/2.15
% 1.93/2.15 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 1.93/2.15
% 1.93/2.15 All clauses are units, and equality is present; the
% 1.93/2.15 strategy will be Knuth-Bendix with positive clauses in sos.
% 1.93/2.15
% 1.93/2.15 dependent: set(knuth_bendix).
% 1.93/2.15 dependent: set(anl_eq).
% 1.93/2.15 dependent: set(para_from).
% 1.93/2.15 dependent: set(para_into).
% 1.93/2.15 dependent: clear(para_from_right).
% 1.93/2.15 dependent: clear(para_into_right).
% 1.93/2.15 dependent: set(para_from_vars).
% 1.93/2.15 dependent: set(eq_units_both_ways).
% 1.93/2.15 dependent: set(dynamic_demod_all).
% 1.93/2.15 dependent: set(dynamic_demod).
% 1.93/2.15 dependent: set(order_eq).
% 1.93/2.15 dependent: set(back_demod).
% 1.93/2.15 dependent: set(lrpo).
% 1.93/2.15
% 1.93/2.15 ------------> process usable:
% 1.93/2.15 ** KEPT (pick-wt=9): 2 [copy,1,flip.1] apply(fixed_pt,apply(strong_fixed_point,fixed_pt))!=apply(strong_fixed_point,fixed_pt).
% 1.93/2.15
% 1.93/2.15 ------------> process sos:
% 1.93/2.15 ** KEPT (pick-wt=3): 3 [] A=A.
% 1.93/2.15 ** KEPT (pick-wt=13): 4 [] apply(apply(apply(b,A),B),C)=apply(A,apply(B,C)).
% 1.93/2.15 ---> New Demodulator: 5 [new_demod,4] apply(apply(apply(b,A),B),C)=apply(A,apply(B,C)).
% 1.93/2.15 ** KEPT (pick-wt=11): 6 [] apply(apply(w1,A),B)=apply(apply(B,A),A).
% 1.93/2.15 ** KEPT (pick-wt=19): 8 [copy,7,flip.1] apply(apply(b,apply(apply(b,apply(w1,w1)),apply(b,w1))),apply(apply(b,b),b))=strong_fixed_point.
% 1.93/2.15 ---> New Demodulator: 9 [new_demod,8] apply(apply(b,apply(apply(b,apply(w1,w1)),apply(b,w1))),apply(apply(b,b),b))=strong_fixed_point.
% 1.93/2.15 Following clause subsumed by 3 during input processing: 0 [copy,3,flip.1] A=A.
% 1.93/2.15 >>>> Starting back demodulation with 5.
% 1.93/2.15 ** KEPT (pick-wt=11): 10 [copy,6,flip.1] apply(apply(A,B),B)=apply(apply(w1,B),A).
% 1.93/2.15 >>>> Starting back demodulation with 9.
% 1.93/2.15 Following clause subsumed by 6 during input processing: 0 [copy,10,flip.1] apply(apply(w1,A),B)=apply(apply(B,A),A).
% 1.93/2.15
% 1.93/2.15 ======= end of input processing =======
% 1.93/2.15
% 1.93/2.15 =========== start of search ===========
% 1.93/2.15
% 1.93/2.15
% 1.93/2.15 Resetting weight limit to 19.
% 1.93/2.15
% 1.93/2.15
% 1.93/2.15 Resetting weight limit to 19.
% 1.93/2.15
% 1.93/2.15 sos_size=886
% 1.93/2.15
% 1.93/2.15 -------- PROOF --------
% 1.93/2.15
% 1.93/2.15 ----> UNIT CONFLICT at 0.23 sec ----> 1546 [binary,1544.1,2.1] $F.
% 1.93/2.15
% 1.93/2.15 Length of proof is 12. Level of proof is 6.
% 1.93/2.15
% 1.93/2.15 ---------------- PROOF ----------------
% 1.93/2.15 % SZS status Unsatisfiable
% 1.93/2.15 % SZS output start Refutation
% See solution above
% 1.93/2.15 ------------ end of proof -------------
% 1.93/2.15
% 1.93/2.15
% 1.93/2.15 Search stopped by max_proofs option.
% 1.93/2.15
% 1.93/2.15
% 1.93/2.15 Search stopped by max_proofs option.
% 1.93/2.15
% 1.93/2.15 ============ end of search ============
% 1.93/2.15
% 1.93/2.15 -------------- statistics -------------
% 1.93/2.15 clauses given 133
% 1.93/2.15 clauses generated 8510
% 1.93/2.15 clauses kept 1109
% 1.93/2.15 clauses forward subsumed 1831
% 1.93/2.15 clauses back subsumed 12
% 1.93/2.15 Kbytes malloced 4882
% 1.93/2.15
% 1.93/2.15 ----------- times (seconds) -----------
% 1.93/2.15 user CPU time 0.23 (0 hr, 0 min, 0 sec)
% 1.93/2.15 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.93/2.15 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.93/2.15
% 1.93/2.15 That finishes the proof of the theorem.
% 1.93/2.15
% 1.93/2.15 Process 1133 finished Wed Jul 27 02:45:08 2022
% 1.93/2.15 Otter interrupted
% 1.93/2.15 PROOF FOUND
%------------------------------------------------------------------------------