TSTP Solution File: COL058-3 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : COL058-3 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n026.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:06 EDT 2022
% Result : Unsatisfiable 1.90s 2.09s
% Output : Refutation 1.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 2
% Syntax : Number of clauses : 10 ( 10 unt; 0 nHn; 4 RR)
% Number of literals : 10 ( 9 equ; 3 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 : 2 ( 2 usr; 1 con; 0-2 aty)
% Number of variables : 12 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
response(response(response(response(lark,lark),response(lark,response(lark,lark))),response(lark,response(lark,lark))),response(response(response(lark,lark),response(lark,response(lark,lark))),response(lark,response(lark,lark)))) != response(response(response(lark,lark),response(lark,response(lark,lark))),response(lark,response(lark,lark))),
file('COL058-3.p',unknown),
[] ).
cnf(3,axiom,
response(response(lark,A),B) = response(A,response(B,B)),
file('COL058-3.p',unknown),
[] ).
cnf(4,plain,
response(A,response(B,B)) = response(response(lark,A),B),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[3])]),
[iquote('copy,3,flip.1')] ).
cnf(13,plain,
response(response(response(lark,lark),A),B) = response(response(A,A),response(B,B)),
inference(para_from,[status(thm),theory(equality)],[4,3]),
[iquote('para_from,4.1.1,3.1.1.1')] ).
cnf(18,plain,
response(response(A,A),response(B,B)) = response(response(response(lark,lark),A),B),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[13])]),
[iquote('copy,13,flip.1')] ).
cnf(24,plain,
response(response(response(response(lark,lark),response(lark,response(lark,lark))),response(lark,response(lark,lark))),response(response(response(lark,response(lark,lark)),response(lark,response(lark,lark))),response(response(lark,response(lark,lark)),response(lark,response(lark,lark))))) != response(response(response(lark,lark),response(lark,response(lark,lark))),response(lark,response(lark,lark))),
inference(para_from,[status(thm),theory(equality)],[13,1]),
[iquote('para_from,13.1.1,1.1.1.2')] ).
cnf(28,plain,
response(response(response(response(lark,lark),A),A),response(B,B)) = response(response(response(lark,lark),response(A,A)),B),
inference(para_into,[status(thm),theory(equality)],[18,18]),
[iquote('para_into,18.1.1.1,18.1.1')] ).
cnf(33,plain,
response(response(A,response(response(lark,A),response(lark,A))),response(B,B)) = response(response(response(lark,lark),response(lark,A)),B),
inference(para_into,[status(thm),theory(equality)],[18,3]),
[iquote('para_into,18.1.1.1,3.1.1')] ).
cnf(42,plain,
response(response(response(lark,lark),response(response(lark,response(lark,lark)),response(lark,response(lark,lark)))),response(response(lark,response(lark,lark)),response(lark,response(lark,lark)))) != response(response(response(lark,lark),response(lark,response(lark,lark))),response(lark,response(lark,lark))),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[24]),28]),
[iquote('back_demod,24,demod,28')] ).
cnf(43,plain,
$false,
inference(binary,[status(thm)],[42,33]),
[iquote('binary,42.1,33.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : COL058-3 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n026.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:38:24 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.90/2.09 ----- Otter 3.3f, August 2004 -----
% 1.90/2.09 The process was started by sandbox2 on n026.cluster.edu,
% 1.90/2.09 Wed Jul 27 02:38:24 2022
% 1.90/2.09 The command was "./otter". The process ID is 22138.
% 1.90/2.09
% 1.90/2.09 set(prolog_style_variables).
% 1.90/2.09 set(auto).
% 1.90/2.09 dependent: set(auto1).
% 1.90/2.09 dependent: set(process_input).
% 1.90/2.09 dependent: clear(print_kept).
% 1.90/2.09 dependent: clear(print_new_demod).
% 1.90/2.09 dependent: clear(print_back_demod).
% 1.90/2.09 dependent: clear(print_back_sub).
% 1.90/2.09 dependent: set(control_memory).
% 1.90/2.09 dependent: assign(max_mem, 12000).
% 1.90/2.09 dependent: assign(pick_given_ratio, 4).
% 1.90/2.09 dependent: assign(stats_level, 1).
% 1.90/2.09 dependent: assign(max_seconds, 10800).
% 1.90/2.09 clear(print_given).
% 1.90/2.09
% 1.90/2.09 list(usable).
% 1.90/2.09 0 [] A=A.
% 1.90/2.09 0 [] response(response(lark,X1),X2)=response(X1,response(X2,X2)).
% 1.90/2.09 0 [] response(response(response(response(lark,lark),response(lark,response(lark,lark))),response(lark,response(lark,lark))),response(response(response(lark,lark),response(lark,response(lark,lark))),response(lark,response(lark,lark))))!=response(response(response(lark,lark),response(lark,response(lark,lark))),response(lark,response(lark,lark))).
% 1.90/2.09 end_of_list.
% 1.90/2.09
% 1.90/2.09 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 1.90/2.09
% 1.90/2.09 All clauses are units, and equality is present; the
% 1.90/2.09 strategy will be Knuth-Bendix with positive clauses in sos.
% 1.90/2.09
% 1.90/2.09 dependent: set(knuth_bendix).
% 1.90/2.09 dependent: set(anl_eq).
% 1.90/2.09 dependent: set(para_from).
% 1.90/2.09 dependent: set(para_into).
% 1.90/2.09 dependent: clear(para_from_right).
% 1.90/2.09 dependent: clear(para_into_right).
% 1.90/2.09 dependent: set(para_from_vars).
% 1.90/2.09 dependent: set(eq_units_both_ways).
% 1.90/2.09 dependent: set(dynamic_demod_all).
% 1.90/2.09 dependent: set(dynamic_demod).
% 1.90/2.09 dependent: set(order_eq).
% 1.90/2.09 dependent: set(back_demod).
% 1.90/2.09 dependent: set(lrpo).
% 1.90/2.09
% 1.90/2.09 ------------> process usable:
% 1.90/2.09 ** KEPT (pick-wt=47): 1 [] response(response(response(response(lark,lark),response(lark,response(lark,lark))),response(lark,response(lark,lark))),response(response(response(lark,lark),response(lark,response(lark,lark))),response(lark,response(lark,lark))))!=response(response(response(lark,lark),response(lark,response(lark,lark))),response(lark,response(lark,lark))).
% 1.90/2.09
% 1.90/2.09 ------------> process sos:
% 1.90/2.09 ** KEPT (pick-wt=3): 2 [] A=A.
% 1.90/2.09 ** KEPT (pick-wt=11): 3 [] response(response(lark,A),B)=response(A,response(B,B)).
% 1.90/2.09 Following clause subsumed by 2 during input processing: 0 [copy,2,flip.1] A=A.
% 1.90/2.09 ** KEPT (pick-wt=11): 4 [copy,3,flip.1] response(A,response(B,B))=response(response(lark,A),B).
% 1.90/2.09 Following clause subsumed by 3 during input processing: 0 [copy,4,flip.1] response(response(lark,A),B)=response(A,response(B,B)).
% 1.90/2.09
% 1.90/2.09 ======= end of input processing =======
% 1.90/2.09
% 1.90/2.09 =========== start of search ===========
% 1.90/2.09
% 1.90/2.09 -------- PROOF --------
% 1.90/2.09
% 1.90/2.09 ----> UNIT CONFLICT at 0.00 sec ----> 43 [binary,42.1,33.1] $F.
% 1.90/2.09
% 1.90/2.09 Length of proof is 7. Level of proof is 5.
% 1.90/2.09
% 1.90/2.09 ---------------- PROOF ----------------
% 1.90/2.09 % SZS status Unsatisfiable
% 1.90/2.09 % SZS output start Refutation
% See solution above
% 1.90/2.09 ------------ end of proof -------------
% 1.90/2.09
% 1.90/2.09
% 1.90/2.09 Search stopped by max_proofs option.
% 1.90/2.09
% 1.90/2.09
% 1.90/2.09 Search stopped by max_proofs option.
% 1.90/2.09
% 1.90/2.09 ============ end of search ============
% 1.90/2.09
% 1.90/2.09 -------------- statistics -------------
% 1.90/2.09 clauses given 5
% 1.90/2.09 clauses generated 37
% 1.90/2.09 clauses kept 38
% 1.90/2.09 clauses forward subsumed 20
% 1.90/2.09 clauses back subsumed 0
% 1.90/2.09 Kbytes malloced 976
% 1.90/2.09
% 1.90/2.09 ----------- times (seconds) -----------
% 1.90/2.09 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.90/2.09 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.90/2.09 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.90/2.09
% 1.90/2.09 That finishes the proof of the theorem.
% 1.90/2.09
% 1.90/2.09 Process 22138 finished Wed Jul 27 02:38:25 2022
% 1.90/2.09 Otter interrupted
% 1.90/2.09 PROOF FOUND
%------------------------------------------------------------------------------