TSTP Solution File: COL070-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : COL070-1 : TPTP v8.1.0. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n025.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:10 EDT 2022
% Result : Unsatisfiable 1.78s 2.02s
% Output : Refutation 1.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of clauses : 8 ( 8 unt; 0 nHn; 3 RR)
% Number of literals : 8 ( 7 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 : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 17 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
A != apply(combinator,A),
file('COL070-1.p',unknown),
[] ).
cnf(2,plain,
apply(combinator,A) != A,
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[1])]),
[iquote('copy,1,flip.1')] ).
cnf(4,axiom,
apply(apply(apply(n1,A),B),C) = apply(apply(apply(A,B),B),C),
file('COL070-1.p',unknown),
[] ).
cnf(5,axiom,
apply(apply(apply(b,A),B),C) = apply(A,apply(B,C)),
file('COL070-1.p',unknown),
[] ).
cnf(7,plain,
apply(apply(apply(A,B),B),C) = apply(apply(apply(n1,A),B),C),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[4])]),
[iquote('copy,4,flip.1')] ).
cnf(15,plain,
apply(apply(A,apply(B,B)),C) = apply(apply(apply(n1,apply(b,A)),B),C),
inference(para_into,[status(thm),theory(equality)],[7,5]),
[iquote('para_into,7.1.1.1,5.1.1')] ).
cnf(96,plain,
apply(A,apply(apply(B,B),C)) = apply(apply(apply(n1,apply(b,apply(b,A))),B),C),
inference(para_into,[status(thm),theory(equality)],[15,5]),
[iquote('para_into,15.1.1,5.1.1')] ).
cnf(97,plain,
$false,
inference(binary,[status(thm)],[96,2]),
[iquote('binary,96.1,2.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : COL070-1 : TPTP v8.1.0. Released v1.2.0.
% 0.09/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n025.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:34:00 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.78/2.02 ----- Otter 3.3f, August 2004 -----
% 1.78/2.02 The process was started by sandbox on n025.cluster.edu,
% 1.78/2.02 Wed Jul 27 02:34:00 2022
% 1.78/2.02 The command was "./otter". The process ID is 25048.
% 1.78/2.02
% 1.78/2.02 set(prolog_style_variables).
% 1.78/2.02 set(auto).
% 1.78/2.02 dependent: set(auto1).
% 1.78/2.02 dependent: set(process_input).
% 1.78/2.02 dependent: clear(print_kept).
% 1.78/2.02 dependent: clear(print_new_demod).
% 1.78/2.02 dependent: clear(print_back_demod).
% 1.78/2.02 dependent: clear(print_back_sub).
% 1.78/2.02 dependent: set(control_memory).
% 1.78/2.02 dependent: assign(max_mem, 12000).
% 1.78/2.02 dependent: assign(pick_given_ratio, 4).
% 1.78/2.02 dependent: assign(stats_level, 1).
% 1.78/2.02 dependent: assign(max_seconds, 10800).
% 1.78/2.02 clear(print_given).
% 1.78/2.02
% 1.78/2.02 list(usable).
% 1.78/2.02 0 [] A=A.
% 1.78/2.02 0 [] apply(apply(apply(n1,X),Y),Z)=apply(apply(apply(X,Y),Y),Z).
% 1.78/2.02 0 [] apply(apply(apply(b,X),Y),Z)=apply(X,apply(Y,Z)).
% 1.78/2.02 0 [] Y!=apply(combinator,Y).
% 1.78/2.02 end_of_list.
% 1.78/2.02
% 1.78/2.02 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 1.78/2.02
% 1.78/2.02 All clauses are units, and equality is present; the
% 1.78/2.02 strategy will be Knuth-Bendix with positive clauses in sos.
% 1.78/2.02
% 1.78/2.02 dependent: set(knuth_bendix).
% 1.78/2.02 dependent: set(anl_eq).
% 1.78/2.02 dependent: set(para_from).
% 1.78/2.02 dependent: set(para_into).
% 1.78/2.02 dependent: clear(para_from_right).
% 1.78/2.02 dependent: clear(para_into_right).
% 1.78/2.02 dependent: set(para_from_vars).
% 1.78/2.02 dependent: set(eq_units_both_ways).
% 1.78/2.02 dependent: set(dynamic_demod_all).
% 1.78/2.02 dependent: set(dynamic_demod).
% 1.78/2.02 dependent: set(order_eq).
% 1.78/2.02 dependent: set(back_demod).
% 1.78/2.02 dependent: set(lrpo).
% 1.78/2.02
% 1.78/2.02 ------------> process usable:
% 1.78/2.02 ** KEPT (pick-wt=5): 2 [copy,1,flip.1] apply(combinator,A)!=A.
% 1.78/2.02
% 1.78/2.02 ------------> process sos:
% 1.78/2.02 ** KEPT (pick-wt=3): 3 [] A=A.
% 1.78/2.02 ** KEPT (pick-wt=15): 4 [] apply(apply(apply(n1,A),B),C)=apply(apply(apply(A,B),B),C).
% 1.78/2.02 ** KEPT (pick-wt=13): 5 [] apply(apply(apply(b,A),B),C)=apply(A,apply(B,C)).
% 1.78/2.02 ---> New Demodulator: 6 [new_demod,5] apply(apply(apply(b,A),B),C)=apply(A,apply(B,C)).
% 1.78/2.02 Following clause subsumed by 3 during input processing: 0 [copy,3,flip.1] A=A.
% 1.78/2.02 ** KEPT (pick-wt=15): 7 [copy,4,flip.1] apply(apply(apply(A,B),B),C)=apply(apply(apply(n1,A),B),C).
% 1.78/2.02 >>>> Starting back demodulation with 6.
% 1.78/2.02 Following clause subsumed by 4 during input processing: 0 [copy,7,flip.1] apply(apply(apply(n1,A),B),C)=apply(apply(apply(A,B),B),C).
% 1.78/2.02
% 1.78/2.02 ======= end of input processing =======
% 1.78/2.02
% 1.78/2.02 =========== start of search ===========
% 1.78/2.02
% 1.78/2.02 -------- PROOF --------
% 1.78/2.02
% 1.78/2.02 ----> UNIT CONFLICT at 0.00 sec ----> 97 [binary,96.1,2.1] $F.
% 1.78/2.02
% 1.78/2.02 Length of proof is 4. Level of proof is 3.
% 1.78/2.02
% 1.78/2.02 ---------------- PROOF ----------------
% 1.78/2.02 % SZS status Unsatisfiable
% 1.78/2.02 % SZS output start Refutation
% See solution above
% 1.78/2.02 ------------ end of proof -------------
% 1.78/2.02
% 1.78/2.02
% 1.78/2.02 Search stopped by max_proofs option.
% 1.78/2.02
% 1.78/2.02
% 1.78/2.02 Search stopped by max_proofs option.
% 1.78/2.02
% 1.78/2.02 ============ end of search ============
% 1.78/2.02
% 1.78/2.02 -------------- statistics -------------
% 1.78/2.02 clauses given 10
% 1.78/2.02 clauses generated 108
% 1.78/2.02 clauses kept 71
% 1.78/2.02 clauses forward subsumed 68
% 1.78/2.02 clauses back subsumed 2
% 1.78/2.02 Kbytes malloced 1953
% 1.78/2.02
% 1.78/2.02 ----------- times (seconds) -----------
% 1.78/2.02 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.78/2.02 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.78/2.02 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.78/2.02
% 1.78/2.02 That finishes the proof of the theorem.
% 1.78/2.02
% 1.78/2.02 Process 25048 finished Wed Jul 27 02:34:02 2022
% 1.78/2.02 Otter interrupted
% 1.78/2.02 PROOF FOUND
%------------------------------------------------------------------------------