TSTP Solution File: COL054-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : COL054-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n019.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:05 EDT 2022
% Result : Unsatisfiable 1.71s 1.90s
% Output : Refutation 1.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of clauses : 9 ( 8 unt; 0 nHn; 2 RR)
% Number of literals : 10 ( 9 equ; 2 neg)
% Maximal clause size : 2 ( 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; 3 con; 0-2 aty)
% Number of variables : 15 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( response(a,A) != B
| response(b,B) != A ),
file('COL054-1.p',unknown),
[] ).
cnf(2,axiom,
A = A,
file('COL054-1.p',unknown),
[] ).
cnf(3,axiom,
response(mocking_bird,A) = response(A,A),
file('COL054-1.p',unknown),
[] ).
cnf(4,axiom,
response(compose(A,B),C) = response(A,response(B,C)),
file('COL054-1.p',unknown),
[] ).
cnf(6,plain,
response(A,A) = response(mocking_bird,A),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[3])]),
[iquote('copy,3,flip.1')] ).
cnf(10,plain,
response(mocking_bird,compose(A,B)) = response(A,response(B,compose(A,B))),
inference(para_into,[status(thm),theory(equality)],[4,6]),
[iquote('para_into,4.1.1,6.1.1')] ).
cnf(11,plain,
response(A,response(B,compose(A,B))) = response(mocking_bird,compose(A,B)),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[10])]),
[iquote('copy,10,flip.1')] ).
cnf(14,plain,
response(A,response(B,response(C,compose(A,compose(B,C))))) = response(mocking_bird,compose(A,compose(B,C))),
inference(para_into,[status(thm),theory(equality)],[11,4]),
[iquote('para_into,11.1.1.2,4.1.1')] ).
cnf(32,plain,
$false,
inference(hyper,[status(thm)],[14,1,2]),
[iquote('hyper,14,1,2')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : COL054-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.12 % Command : otter-tptp-script %s
% 0.12/0.34 % Computer : n019.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Wed Jul 27 02:26:52 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.71/1.90 ----- Otter 3.3f, August 2004 -----
% 1.71/1.90 The process was started by sandbox2 on n019.cluster.edu,
% 1.71/1.90 Wed Jul 27 02:26:52 2022
% 1.71/1.90 The command was "./otter". The process ID is 25551.
% 1.71/1.90
% 1.71/1.90 set(prolog_style_variables).
% 1.71/1.90 set(auto).
% 1.71/1.90 dependent: set(auto1).
% 1.71/1.90 dependent: set(process_input).
% 1.71/1.90 dependent: clear(print_kept).
% 1.71/1.90 dependent: clear(print_new_demod).
% 1.71/1.90 dependent: clear(print_back_demod).
% 1.71/1.90 dependent: clear(print_back_sub).
% 1.71/1.90 dependent: set(control_memory).
% 1.71/1.90 dependent: assign(max_mem, 12000).
% 1.71/1.90 dependent: assign(pick_given_ratio, 4).
% 1.71/1.90 dependent: assign(stats_level, 1).
% 1.71/1.90 dependent: assign(max_seconds, 10800).
% 1.71/1.90 clear(print_given).
% 1.71/1.90
% 1.71/1.90 list(usable).
% 1.71/1.90 0 [] A=A.
% 1.71/1.90 0 [] response(mocking_bird,Y)=response(Y,Y).
% 1.71/1.90 0 [] response(compose(X,Y),W)=response(X,response(Y,W)).
% 1.71/1.90 0 [] response(a,X)!=Y|response(b,Y)!=X.
% 1.71/1.90 end_of_list.
% 1.71/1.90
% 1.71/1.90 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=2.
% 1.71/1.90
% 1.71/1.90 This is a Horn set with equality. The strategy will be
% 1.71/1.90 Knuth-Bendix and hyper_res, with positive clauses in
% 1.71/1.90 sos and nonpositive clauses in usable.
% 1.71/1.90
% 1.71/1.90 dependent: set(knuth_bendix).
% 1.71/1.90 dependent: set(anl_eq).
% 1.71/1.90 dependent: set(para_from).
% 1.71/1.90 dependent: set(para_into).
% 1.71/1.90 dependent: clear(para_from_right).
% 1.71/1.90 dependent: clear(para_into_right).
% 1.71/1.90 dependent: set(para_from_vars).
% 1.71/1.90 dependent: set(eq_units_both_ways).
% 1.71/1.90 dependent: set(dynamic_demod_all).
% 1.71/1.90 dependent: set(dynamic_demod).
% 1.71/1.90 dependent: set(order_eq).
% 1.71/1.90 dependent: set(back_demod).
% 1.71/1.90 dependent: set(lrpo).
% 1.71/1.90 dependent: set(hyper_res).
% 1.71/1.90 dependent: clear(order_hyper).
% 1.71/1.90
% 1.71/1.90 ------------> process usable:
% 1.71/1.90 ** KEPT (pick-wt=10): 1 [] response(a,A)!=B|response(b,B)!=A.
% 1.71/1.90
% 1.71/1.90 ------------> process sos:
% 1.71/1.90 ** KEPT (pick-wt=3): 2 [] A=A.
% 1.71/1.90 ** KEPT (pick-wt=7): 3 [] response(mocking_bird,A)=response(A,A).
% 1.71/1.90 ** KEPT (pick-wt=11): 4 [] response(compose(A,B),C)=response(A,response(B,C)).
% 1.71/1.90 ---> New Demodulator: 5 [new_demod,4] response(compose(A,B),C)=response(A,response(B,C)).
% 1.71/1.90 Following clause subsumed by 2 during input processing: 0 [copy,2,flip.1] A=A.
% 1.71/1.90 ** KEPT (pick-wt=7): 6 [copy,3,flip.1] response(A,A)=response(mocking_bird,A).
% 1.71/1.90 >>>> Starting back demodulation with 5.
% 1.71/1.90 Following clause subsumed by 3 during input processing: 0 [copy,6,flip.1] response(mocking_bird,A)=response(A,A).
% 1.71/1.90
% 1.71/1.90 ======= end of input processing =======
% 1.71/1.90
% 1.71/1.90 =========== start of search ===========
% 1.71/1.90
% 1.71/1.90 -------- PROOF --------
% 1.71/1.90
% 1.71/1.90 -----> EMPTY CLAUSE at 0.00 sec ----> 32 [hyper,14,1,2] $F.
% 1.71/1.90
% 1.71/1.90 Length of proof is 4. Level of proof is 4.
% 1.71/1.90
% 1.71/1.90 ---------------- PROOF ----------------
% 1.71/1.90 % SZS status Unsatisfiable
% 1.71/1.90 % SZS output start Refutation
% See solution above
% 1.71/1.90 ------------ end of proof -------------
% 1.71/1.90
% 1.71/1.90
% 1.71/1.90 Search stopped by max_proofs option.
% 1.71/1.90
% 1.71/1.90
% 1.71/1.90 Search stopped by max_proofs option.
% 1.71/1.90
% 1.71/1.90 ============ end of search ============
% 1.71/1.90
% 1.71/1.90 -------------- statistics -------------
% 1.71/1.90 clauses given 11
% 1.71/1.90 clauses generated 51
% 1.71/1.90 clauses kept 26
% 1.71/1.90 clauses forward subsumed 37
% 1.71/1.90 clauses back subsumed 0
% 1.71/1.90 Kbytes malloced 976
% 1.71/1.90
% 1.71/1.90 ----------- times (seconds) -----------
% 1.71/1.90 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.71/1.90 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.71/1.90 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.71/1.90
% 1.71/1.90 That finishes the proof of the theorem.
% 1.71/1.90
% 1.71/1.90 Process 25551 finished Wed Jul 27 02:26:53 2022
% 1.71/1.90 Otter interrupted
% 1.71/1.90 PROOF FOUND
%------------------------------------------------------------------------------