TSTP Solution File: COL124-2 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : COL124-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n020.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:18 EDT 2022
% Result : Unsatisfiable 1.93s 2.10s
% Output : Refutation 1.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 3
% Syntax : Number of clauses : 5 ( 4 unt; 0 nHn; 3 RR)
% Number of literals : 7 ( 0 equ; 3 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-4 aty)
% Number of variables : 8 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( c_in(c_Pair(A,v_x(B,A,C),tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Ocontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb))
| ~ c_in(c_Pair(B,C,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Ocontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb))
| ~ c_in(c_Pair(B,A,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Ocontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)) ),
file('COL124-2.p',unknown),
[] ).
cnf(2,axiom,
~ c_in(c_Pair(c_Comb_OI,A,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Ocontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)),
file('COL124-2.p',unknown),
[] ).
cnf(3,axiom,
c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_OK,A),B),A,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Ocontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)),
file('COL124-2.p',unknown),
[] ).
cnf(4,plain,
c_in(c_Pair(A,v_x(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_OK,A),B),A,A),tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Ocontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)),
inference(hyper,[status(thm)],[3,1,3]),
[iquote('hyper,3,1,3')] ).
cnf(5,plain,
$false,
inference(binary,[status(thm)],[4,2]),
[iquote('binary,4.1,2.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : COL124-2 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13 % Command : otter-tptp-script %s
% 0.13/0.34 % Computer : n020.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Wed Jul 27 02:27:23 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.93/2.10 ----- Otter 3.3f, August 2004 -----
% 1.93/2.10 The process was started by sandbox on n020.cluster.edu,
% 1.93/2.10 Wed Jul 27 02:27:23 2022
% 1.93/2.10 The command was "./otter". The process ID is 18490.
% 1.93/2.10
% 1.93/2.10 set(prolog_style_variables).
% 1.93/2.10 set(auto).
% 1.93/2.10 dependent: set(auto1).
% 1.93/2.10 dependent: set(process_input).
% 1.93/2.10 dependent: clear(print_kept).
% 1.93/2.10 dependent: clear(print_new_demod).
% 1.93/2.10 dependent: clear(print_back_demod).
% 1.93/2.10 dependent: clear(print_back_sub).
% 1.93/2.10 dependent: set(control_memory).
% 1.93/2.10 dependent: assign(max_mem, 12000).
% 1.93/2.10 dependent: assign(pick_given_ratio, 4).
% 1.93/2.10 dependent: assign(stats_level, 1).
% 1.93/2.10 dependent: assign(max_seconds, 10800).
% 1.93/2.10 clear(print_given).
% 1.93/2.10
% 1.93/2.10 list(usable).
% 1.93/2.10 0 [] c_in(c_Pair(V_V,v_x(V_U,V_V,V_W),tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Ocontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb))| -c_in(c_Pair(V_U,V_W,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Ocontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb))| -c_in(c_Pair(V_U,V_V,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Ocontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)).
% 1.93/2.10 0 [] -c_in(c_Pair(c_Comb_OI,V_z,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Ocontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)).
% 1.93/2.10 0 [] c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_OK,V_x),V_y),V_x,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Ocontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)).
% 1.93/2.10 end_of_list.
% 1.93/2.10
% 1.93/2.10 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 1.93/2.10
% 1.93/2.10 This is a Horn set without equality. The strategy will
% 1.93/2.10 be hyperresolution, with satellites in sos and nuclei
% 1.93/2.10 in usable.
% 1.93/2.10
% 1.93/2.10 dependent: set(hyper_res).
% 1.93/2.10 dependent: clear(order_hyper).
% 1.93/2.10
% 1.93/2.10 ------------> process usable:
% 1.93/2.10 ** KEPT (pick-wt=33): 1 [] c_in(c_Pair(A,v_x(B,A,C),tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Ocontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb))| -c_in(c_Pair(B,C,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Ocontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb))| -c_in(c_Pair(B,A,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Ocontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)).
% 1.93/2.10 ** KEPT (pick-wt=10): 2 [] -c_in(c_Pair(c_Comb_OI,A,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Ocontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)).
% 1.93/2.10
% 1.93/2.10 ------------> process sos:
% 1.93/2.10 ** KEPT (pick-wt=14): 3 [] c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_OK,A),B),A,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Ocontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)).
% 1.93/2.10
% 1.93/2.10 ======= end of input processing =======
% 1.93/2.10
% 1.93/2.10 =========== start of search ===========
% 1.93/2.10
% 1.93/2.10 -------- PROOF --------
% 1.93/2.10
% 1.93/2.10 ----> UNIT CONFLICT at 0.00 sec ----> 5 [binary,4.1,2.1] $F.
% 1.93/2.10
% 1.93/2.10 Length of proof is 1. Level of proof is 1.
% 1.93/2.10
% 1.93/2.10 ---------------- PROOF ----------------
% 1.93/2.10 % SZS status Unsatisfiable
% 1.93/2.10 % SZS output start Refutation
% See solution above
% 1.93/2.10 ------------ end of proof -------------
% 1.93/2.10
% 1.93/2.10
% 1.93/2.10 Search stopped by max_proofs option.
% 1.93/2.10
% 1.93/2.10
% 1.93/2.10 Search stopped by max_proofs option.
% 1.93/2.10
% 1.93/2.10 ============ end of search ============
% 1.93/2.10
% 1.93/2.10 -------------- statistics -------------
% 1.93/2.10 clauses given 1
% 1.93/2.10 clauses generated 1
% 1.93/2.10 clauses kept 4
% 1.93/2.10 clauses forward subsumed 0
% 1.93/2.10 clauses back subsumed 0
% 1.93/2.10 Kbytes malloced 976
% 1.93/2.10
% 1.93/2.10 ----------- times (seconds) -----------
% 1.93/2.10 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.93/2.10 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.93/2.10 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.93/2.10
% 1.93/2.10 That finishes the proof of the theorem.
% 1.93/2.10
% 1.93/2.10 Process 18490 finished Wed Jul 27 02:27:25 2022
% 1.93/2.10 Otter interrupted
% 1.93/2.10 PROOF FOUND
%------------------------------------------------------------------------------