%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LAT273-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n023.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 13:02:16 EDT 2022
% Result : Unsatisfiable 1.84s 2.05s
% Output : Refutation 1.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of clauses : 11 ( 8 unt; 1 nHn; 11 RR)
% Number of literals : 19 ( 0 equ; 8 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-4 aty)
% Number of functors : 13 ( 13 usr; 8 con; 0-4 aty)
% Number of variables : 12 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ c_in(A,B,C)
| ~ c_lesse_quals(B,c_Tarski_Ointerval(D,E,F,C),tc_set(C))
| c_in(c_Pair(A,F,C,C),D,tc_prod(C,C)) ),
file('LAT273-2.p',unknown),
[] ).
cnf(2,axiom,
( ~ c_Tarski_OisLub(A,v_cl,B,t_a)
| ~ c_in(C,v_A,t_a)
| c_in(c_Pair(B,C,t_a,t_a),v_r,tc_prod(t_a,t_a))
| c_in(v_sko__4mi(A,v_r,C),A,t_a) ),
file('LAT273-2.p',unknown),
[] ).
cnf(3,axiom,
( ~ c_Tarski_OisLub(A,v_cl,B,t_a)
| ~ c_in(C,v_A,t_a)
| ~ c_in(c_Pair(v_sko__4mi(A,v_r,C),C,t_a,t_a),v_r,tc_prod(t_a,t_a))
| c_in(c_Pair(B,C,t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
file('LAT273-2.p',unknown),
[] ).
cnf(4,axiom,
~ c_in(c_Pair(v_L,v_b,t_a,t_a),v_r,tc_prod(t_a,t_a)),
file('LAT273-2.p',unknown),
[] ).
cnf(5,axiom,
c_in(v_b,v_A,t_a),
file('LAT273-2.p',unknown),
[] ).
cnf(6,axiom,
c_lesse_quals(v_S,c_Tarski_Ointerval(v_r,v_a,v_b,t_a),tc_set(t_a)),
file('LAT273-2.p',unknown),
[] ).
cnf(7,axiom,
c_Tarski_OisLub(v_S,v_cl,v_L,t_a),
file('LAT273-2.p',unknown),
[] ).
cnf(8,plain,
c_in(v_sko__4mi(v_S,v_r,v_b),v_S,t_a),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[7,2,5]),4]),
[iquote('hyper,7,2,5,unit_del,4')] ).
cnf(9,plain,
c_in(c_Pair(v_sko__4mi(v_S,v_r,v_b),v_b,t_a,t_a),v_r,tc_prod(t_a,t_a)),
inference(hyper,[status(thm)],[6,1,8]),
[iquote('hyper,6,1,8')] ).
cnf(10,plain,
c_in(c_Pair(v_L,v_b,t_a,t_a),v_r,tc_prod(t_a,t_a)),
inference(hyper,[status(thm)],[9,3,7,5]),
[iquote('hyper,9,3,7,5')] ).
cnf(11,plain,
$false,
inference(binary,[status(thm)],[10,4]),
[iquote('binary,10.1,4.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : LAT273-2 : TPTP v8.1.0. Released v3.2.0.
% 0.06/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n023.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 08:46:03 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.84/2.05 ----- Otter 3.3f, August 2004 -----
% 1.84/2.05 The process was started by sandbox2 on n023.cluster.edu,
% 1.84/2.05 Wed Jul 27 08:46:03 2022
% 1.84/2.05 The command was "./otter". The process ID is 22015.
% 1.84/2.05
% 1.84/2.05 set(prolog_style_variables).
% 1.84/2.05 set(auto).
% 1.84/2.05 dependent: set(auto1).
% 1.84/2.05 dependent: set(process_input).
% 1.84/2.05 dependent: clear(print_kept).
% 1.84/2.05 dependent: clear(print_new_demod).
% 1.84/2.05 dependent: clear(print_back_demod).
% 1.84/2.05 dependent: clear(print_back_sub).
% 1.84/2.05 dependent: set(control_memory).
% 1.84/2.05 dependent: assign(max_mem, 12000).
% 1.84/2.05 dependent: assign(pick_given_ratio, 4).
% 1.84/2.05 dependent: assign(stats_level, 1).
% 1.84/2.05 dependent: assign(max_seconds, 10800).
% 1.84/2.05 clear(print_given).
% 1.84/2.05
% 1.84/2.05 list(usable).
% 1.84/2.05 0 [] -c_in(V_x,V_S,T_a)| -c_lesse_quals(V_S,c_Tarski_Ointerval(V_r,V_a,V_b,T_a),tc_set(T_a))|c_in(c_Pair(V_x,V_b,T_a,T_a),V_r,tc_prod(T_a,T_a)).
% 1.84/2.05 0 [] -c_Tarski_OisLub(V_S,v_cl,V_L,t_a)| -c_in(V_z,v_A,t_a)|c_in(c_Pair(V_L,V_z,t_a,t_a),v_r,tc_prod(t_a,t_a))|c_in(v_sko__4mi(V_S,v_r,V_z),V_S,t_a).
% 1.84/2.05 0 [] -c_Tarski_OisLub(V_S,v_cl,V_L,t_a)| -c_in(V_z,v_A,t_a)| -c_in(c_Pair(v_sko__4mi(V_S,v_r,V_z),V_z,t_a,t_a),v_r,tc_prod(t_a,t_a))|c_in(c_Pair(V_L,V_z,t_a,t_a),v_r,tc_prod(t_a,t_a)).
% 1.84/2.05 0 [] c_in(v_b,v_A,t_a).
% 1.84/2.05 0 [] c_lesse_quals(v_S,c_Tarski_Ointerval(v_r,v_a,v_b,t_a),tc_set(t_a)).
% 1.84/2.05 0 [] c_Tarski_OisLub(v_S,v_cl,v_L,t_a).
% 1.84/2.05 0 [] -c_in(c_Pair(v_L,v_b,t_a,t_a),v_r,tc_prod(t_a,t_a)).
% 1.84/2.05 end_of_list.
% 1.84/2.05
% 1.84/2.05 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=4.
% 1.84/2.05
% 1.84/2.05 This is a non-Horn set without equality. The strategy will
% 1.84/2.05 be ordered hyper_res, unit deletion, and factoring, with
% 1.84/2.05 satellites in sos and with nuclei in usable.
% 1.84/2.05
% 1.84/2.05 dependent: set(hyper_res).
% 1.84/2.05 dependent: set(factor).
% 1.84/2.05 dependent: set(unit_deletion).
% 1.84/2.05
% 1.84/2.05 ------------> process usable:
% 1.84/2.05 ** KEPT (pick-wt=23): 1 [] -c_in(A,B,C)| -c_lesse_quals(B,c_Tarski_Ointerval(D,E,F,C),tc_set(C))|c_in(c_Pair(A,F,C,C),D,tc_prod(C,C)).
% 1.84/2.05 ** KEPT (pick-wt=26): 2 [] -c_Tarski_OisLub(A,v_cl,B,t_a)| -c_in(C,v_A,t_a)|c_in(c_Pair(B,C,t_a,t_a),v_r,tc_prod(t_a,t_a))|c_in(v_sko__4mi(A,v_r,C),A,t_a).
% 1.84/2.05 ** KEPT (pick-wt=32): 3 [] -c_Tarski_OisLub(A,v_cl,B,t_a)| -c_in(C,v_A,t_a)| -c_in(c_Pair(v_sko__4mi(A,v_r,C),C,t_a,t_a),v_r,tc_prod(t_a,t_a))|c_in(c_Pair(B,C,t_a,t_a),v_r,tc_prod(t_a,t_a)).
% 1.84/2.05 ** KEPT (pick-wt=10): 4 [] -c_in(c_Pair(v_L,v_b,t_a,t_a),v_r,tc_prod(t_a,t_a)).
% 1.84/2.05
% 1.84/2.05 ------------> process sos:
% 1.84/2.05 ** KEPT (pick-wt=4): 5 [] c_in(v_b,v_A,t_a).
% 1.84/2.05 ** KEPT (pick-wt=9): 6 [] c_lesse_quals(v_S,c_Tarski_Ointerval(v_r,v_a,v_b,t_a),tc_set(t_a)).
% 1.84/2.05 ** KEPT (pick-wt=5): 7 [] c_Tarski_OisLub(v_S,v_cl,v_L,t_a).
% 1.84/2.05
% 1.84/2.05 ======= end of input processing =======
% 1.84/2.05
% 1.84/2.05 =========== start of search ===========
% 1.84/2.05
% 1.84/2.05 -------- PROOF --------
% 1.84/2.05
% 1.84/2.05 ----> UNIT CONFLICT at 0.00 sec ----> 11 [binary,10.1,4.1] $F.
% 1.84/2.05
% 1.84/2.05 Length of proof is 3. Level of proof is 3.
% 1.84/2.05
% 1.84/2.05 ---------------- PROOF ----------------
% 1.84/2.05 % SZS status Unsatisfiable
% 1.84/2.05 % SZS output start Refutation
% See solution above
% 1.84/2.05 ------------ end of proof -------------
% 1.84/2.05
% 1.84/2.05
% 1.84/2.05 Search stopped by max_proofs option.
% 1.84/2.05
% 1.84/2.05
% 1.84/2.05 Search stopped by max_proofs option.
% 1.84/2.05
% 1.84/2.05 ============ end of search ============
% 1.84/2.05
% 1.84/2.05 -------------- statistics -------------
% 1.84/2.05 clauses given 5
% 1.84/2.05 clauses generated 3
% 1.84/2.05 clauses kept 10
% 1.84/2.05 clauses forward subsumed 0
% 1.84/2.05 clauses back subsumed 0
% 1.84/2.05 Kbytes malloced 976
% 1.84/2.05
% 1.84/2.05 ----------- times (seconds) -----------
% 1.84/2.05 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.84/2.05 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.84/2.05 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.84/2.05
% 1.84/2.05 That finishes the proof of the theorem.
% 1.84/2.05
% 1.84/2.05 Process 22015 finished Wed Jul 27 08:46:05 2022
% 1.84/2.05 Otter interrupted
% 1.84/2.05 PROOF FOUND
%------------------------------------------------------------------------------