TSTP Solution File: COL051-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : COL051-1 : TPTP v8.1.0. Released v1.0.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:05 EDT 2022
% Result : Unsatisfiable 1.65s 1.87s
% Output : Refutation 1.65s
% 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 : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 11 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
response(A,A) != A,
file('COL051-1.p',unknown),
[] ).
cnf(3,axiom,
response(mocking_bird,A) = response(A,A),
file('COL051-1.p',unknown),
[] ).
cnf(4,axiom,
response(compose(A,B),C) = response(A,response(B,C)),
file('COL051-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(7,plain,
response(mocking_bird,A) != A,
inference(para_from,[status(thm),theory(equality)],[6,1]),
[iquote('para_from,6.1.1,1.1.1')] ).
cnf(8,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(9,plain,
response(A,response(B,compose(A,B))) = response(mocking_bird,compose(A,B)),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[8])]),
[iquote('copy,8,flip.1')] ).
cnf(10,plain,
$false,
inference(binary,[status(thm)],[9,7]),
[iquote('binary,9.1,7.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : COL051-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/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:32:33 EDT 2022
% 0.13/0.33 % CPUTime :
% 1.65/1.87 ----- Otter 3.3f, August 2004 -----
% 1.65/1.87 The process was started by sandbox on n028.cluster.edu,
% 1.65/1.87 Wed Jul 27 02:32:33 2022
% 1.65/1.87 The command was "./otter". The process ID is 12356.
% 1.65/1.87
% 1.65/1.87 set(prolog_style_variables).
% 1.65/1.87 set(auto).
% 1.65/1.87 dependent: set(auto1).
% 1.65/1.87 dependent: set(process_input).
% 1.65/1.87 dependent: clear(print_kept).
% 1.65/1.87 dependent: clear(print_new_demod).
% 1.65/1.87 dependent: clear(print_back_demod).
% 1.65/1.87 dependent: clear(print_back_sub).
% 1.65/1.87 dependent: set(control_memory).
% 1.65/1.87 dependent: assign(max_mem, 12000).
% 1.65/1.87 dependent: assign(pick_given_ratio, 4).
% 1.65/1.87 dependent: assign(stats_level, 1).
% 1.65/1.87 dependent: assign(max_seconds, 10800).
% 1.65/1.87 clear(print_given).
% 1.65/1.87
% 1.65/1.87 list(usable).
% 1.65/1.87 0 [] A=A.
% 1.65/1.87 0 [] response(mocking_bird,Y)=response(Y,Y).
% 1.65/1.87 0 [] response(compose(X,Y),W)=response(X,response(Y,W)).
% 1.65/1.87 0 [] response(X,X)!=X.
% 1.65/1.87 end_of_list.
% 1.65/1.87
% 1.65/1.87 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 1.65/1.87
% 1.65/1.87 All clauses are units, and equality is present; the
% 1.65/1.87 strategy will be Knuth-Bendix with positive clauses in sos.
% 1.65/1.87
% 1.65/1.87 dependent: set(knuth_bendix).
% 1.65/1.87 dependent: set(anl_eq).
% 1.65/1.87 dependent: set(para_from).
% 1.65/1.87 dependent: set(para_into).
% 1.65/1.87 dependent: clear(para_from_right).
% 1.65/1.87 dependent: clear(para_into_right).
% 1.65/1.87 dependent: set(para_from_vars).
% 1.65/1.87 dependent: set(eq_units_both_ways).
% 1.65/1.87 dependent: set(dynamic_demod_all).
% 1.65/1.87 dependent: set(dynamic_demod).
% 1.65/1.87 dependent: set(order_eq).
% 1.65/1.87 dependent: set(back_demod).
% 1.65/1.87 dependent: set(lrpo).
% 1.65/1.87
% 1.65/1.87 ------------> process usable:
% 1.65/1.87 ** KEPT (pick-wt=5): 1 [] response(A,A)!=A.
% 1.65/1.87
% 1.65/1.87 ------------> process sos:
% 1.65/1.87 ** KEPT (pick-wt=3): 2 [] A=A.
% 1.65/1.87 ** KEPT (pick-wt=7): 3 [] response(mocking_bird,A)=response(A,A).
% 1.65/1.87 ** KEPT (pick-wt=11): 4 [] response(compose(A,B),C)=response(A,response(B,C)).
% 1.65/1.87 ---> New Demodulator: 5 [new_demod,4] response(compose(A,B),C)=response(A,response(B,C)).
% 1.65/1.87 Following clause subsumed by 2 during input processing: 0 [copy,2,flip.1] A=A.
% 1.65/1.87 ** KEPT (pick-wt=7): 6 [copy,3,flip.1] response(A,A)=response(mocking_bird,A).
% 1.65/1.87 >>>> Starting back demodulation with 5.
% 1.65/1.87 Following clause subsumed by 3 during input processing: 0 [copy,6,flip.1] response(mocking_bird,A)=response(A,A).
% 1.65/1.87
% 1.65/1.87 ======= end of input processing =======
% 1.65/1.87
% 1.65/1.87 =========== start of search ===========
% 1.65/1.87
% 1.65/1.87 -------- PROOF --------
% 1.65/1.87
% 1.65/1.87 ----> UNIT CONFLICT at 0.00 sec ----> 10 [binary,9.1,7.1] $F.
% 1.65/1.87
% 1.65/1.87 Length of proof is 4. Level of proof is 3.
% 1.65/1.87
% 1.65/1.87 ---------------- PROOF ----------------
% 1.65/1.87 % SZS status Unsatisfiable
% 1.65/1.87 % SZS output start Refutation
% See solution above
% 1.65/1.87 ------------ end of proof -------------
% 1.65/1.87
% 1.65/1.87
% 1.65/1.87 Search stopped by max_proofs option.
% 1.65/1.87
% 1.65/1.87
% 1.65/1.87 Search stopped by max_proofs option.
% 1.65/1.87
% 1.65/1.87 ============ end of search ============
% 1.65/1.87
% 1.65/1.87 -------------- statistics -------------
% 1.65/1.87 clauses given 5
% 1.65/1.87 clauses generated 12
% 1.65/1.87 clauses kept 8
% 1.65/1.87 clauses forward subsumed 12
% 1.65/1.87 clauses back subsumed 0
% 1.65/1.87 Kbytes malloced 976
% 1.65/1.87
% 1.65/1.87 ----------- times (seconds) -----------
% 1.65/1.87 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.65/1.87 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.65/1.87 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.65/1.87
% 1.65/1.87 That finishes the proof of the theorem.
% 1.65/1.87
% 1.65/1.87 Process 12356 finished Wed Jul 27 02:32:35 2022
% 1.65/1.87 Otter interrupted
% 1.65/1.87 PROOF FOUND
%------------------------------------------------------------------------------