TSTP Solution File: LAT281-2 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LAT281-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n006.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:18 EDT 2022
% Result : Unsatisfiable 1.92s 2.11s
% Output : Refutation 1.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of clauses : 11 ( 9 unt; 0 nHn; 11 RR)
% Number of literals : 15 ( 2 equ; 5 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 8 con; 0-4 aty)
% Number of variables : 7 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ c_in(c_Pair(v_a,v_c,t_a,t_a),v_r,tc_prod(t_a,t_a)),
file('LAT281-2.p',unknown),
[] ).
cnf(2,axiom,
( ~ c_Relation_Otrans(A,B)
| ~ c_in(c_Pair(C,D,B,B),A,tc_prod(B,B))
| ~ c_in(c_Pair(E,C,B,B),A,tc_prod(B,B))
| c_in(c_Pair(E,D,B,B),A,tc_prod(B,B)) ),
file('LAT281-2.p',unknown),
[] ).
cnf(3,axiom,
( ~ c_in(A,c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(B,tc_Product__Type_Ounit))
| c_Relation_Otrans(c_Tarski_Opotype_Oorder(A,B,tc_Product__Type_Ounit),B) ),
file('LAT281-2.p',unknown),
[] ).
cnf(5,axiom,
c_in(c_Pair(v_a,v_b,t_a,t_a),v_r,tc_prod(t_a,t_a)),
file('LAT281-2.p',unknown),
[] ).
cnf(6,axiom,
c_in(c_Pair(v_b,v_c,t_a,t_a),v_r,tc_prod(t_a,t_a)),
file('LAT281-2.p',unknown),
[] ).
cnf(7,axiom,
c_in(v_cl,c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit)),
file('LAT281-2.p',unknown),
[] ).
cnf(8,axiom,
v_r = c_Tarski_Opotype_Oorder(v_cl,t_a,tc_Product__Type_Ounit),
file('LAT281-2.p',unknown),
[] ).
cnf(10,plain,
c_Tarski_Opotype_Oorder(v_cl,t_a,tc_Product__Type_Ounit) = v_r,
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[8])]),
[iquote('copy,8,flip.1')] ).
cnf(11,plain,
c_Relation_Otrans(v_r,t_a),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[7,3]),10]),
[iquote('hyper,7,3,demod,10')] ).
cnf(12,plain,
c_in(c_Pair(v_a,v_c,t_a,t_a),v_r,tc_prod(t_a,t_a)),
inference(hyper,[status(thm)],[6,2,11,5]),
[iquote('hyper,6,2,11,5')] ).
cnf(13,plain,
$false,
inference(binary,[status(thm)],[12,1]),
[iquote('binary,12.1,1.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : LAT281-2 : TPTP v8.1.0. Released v3.2.0.
% 0.10/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n006.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:14:31 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.92/2.11 ----- Otter 3.3f, August 2004 -----
% 1.92/2.11 The process was started by sandbox2 on n006.cluster.edu,
% 1.92/2.11 Wed Jul 27 08:14:32 2022
% 1.92/2.11 The command was "./otter". The process ID is 14593.
% 1.92/2.11
% 1.92/2.11 set(prolog_style_variables).
% 1.92/2.11 set(auto).
% 1.92/2.11 dependent: set(auto1).
% 1.92/2.11 dependent: set(process_input).
% 1.92/2.11 dependent: clear(print_kept).
% 1.92/2.11 dependent: clear(print_new_demod).
% 1.92/2.11 dependent: clear(print_back_demod).
% 1.92/2.11 dependent: clear(print_back_sub).
% 1.92/2.11 dependent: set(control_memory).
% 1.92/2.11 dependent: assign(max_mem, 12000).
% 1.92/2.11 dependent: assign(pick_given_ratio, 4).
% 1.92/2.11 dependent: assign(stats_level, 1).
% 1.92/2.11 dependent: assign(max_seconds, 10800).
% 1.92/2.11 clear(print_given).
% 1.92/2.11
% 1.92/2.11 list(usable).
% 1.92/2.11 0 [] A=A.
% 1.92/2.11 0 [] c_in(c_Pair(v_a,v_b,t_a,t_a),v_r,tc_prod(t_a,t_a)).
% 1.92/2.11 0 [] c_in(c_Pair(v_b,v_c,t_a,t_a),v_r,tc_prod(t_a,t_a)).
% 1.92/2.11 0 [] -c_in(c_Pair(v_a,v_c,t_a,t_a),v_r,tc_prod(t_a,t_a)).
% 1.92/2.11 0 [] -c_Relation_Otrans(V_r,T_a)| -c_in(c_Pair(V_V,V_W,T_a,T_a),V_r,tc_prod(T_a,T_a))| -c_in(c_Pair(V_U,V_V,T_a,T_a),V_r,tc_prod(T_a,T_a))|c_in(c_Pair(V_U,V_W,T_a,T_a),V_r,tc_prod(T_a,T_a)).
% 1.92/2.11 0 [] -c_in(V_P,c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(T_a,tc_Product__Type_Ounit))|c_Relation_Otrans(c_Tarski_Opotype_Oorder(V_P,T_a,tc_Product__Type_Ounit),T_a).
% 1.92/2.11 0 [] c_in(v_cl,c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit)).
% 1.92/2.11 0 [] v_r=c_Tarski_Opotype_Oorder(v_cl,t_a,tc_Product__Type_Ounit).
% 1.92/2.11 end_of_list.
% 1.92/2.11
% 1.92/2.11 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=4.
% 1.92/2.11
% 1.92/2.11 This is a Horn set with equality. The strategy will be
% 1.92/2.11 Knuth-Bendix and hyper_res, with positive clauses in
% 1.92/2.11 sos and nonpositive clauses in usable.
% 1.92/2.11
% 1.92/2.11 dependent: set(knuth_bendix).
% 1.92/2.11 dependent: set(anl_eq).
% 1.92/2.11 dependent: set(para_from).
% 1.92/2.11 dependent: set(para_into).
% 1.92/2.11 dependent: clear(para_from_right).
% 1.92/2.11 dependent: clear(para_into_right).
% 1.92/2.11 dependent: set(para_from_vars).
% 1.92/2.11 dependent: set(eq_units_both_ways).
% 1.92/2.11 dependent: set(dynamic_demod_all).
% 1.92/2.11 dependent: set(dynamic_demod).
% 1.92/2.11 dependent: set(order_eq).
% 1.92/2.11 dependent: set(back_demod).
% 1.92/2.11 dependent: set(lrpo).
% 1.92/2.11 dependent: set(hyper_res).
% 1.92/2.11 dependent: clear(order_hyper).
% 1.92/2.11
% 1.92/2.11 ------------> process usable:
% 1.92/2.11 ** KEPT (pick-wt=10): 1 [] -c_in(c_Pair(v_a,v_c,t_a,t_a),v_r,tc_prod(t_a,t_a)).
% 1.92/2.11 ** KEPT (pick-wt=33): 2 [] -c_Relation_Otrans(A,B)| -c_in(c_Pair(C,D,B,B),A,tc_prod(B,B))| -c_in(c_Pair(E,C,B,B),A,tc_prod(B,B))|c_in(c_Pair(E,D,B,B),A,tc_prod(B,B)).
% 1.92/2.11 ** KEPT (pick-wt=12): 3 [] -c_in(A,c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(B,tc_Product__Type_Ounit))|c_Relation_Otrans(c_Tarski_Opotype_Oorder(A,B,tc_Product__Type_Ounit),B).
% 1.92/2.11
% 1.92/2.11 ------------> process sos:
% 1.92/2.11 ** KEPT (pick-wt=3): 4 [] A=A.
% 1.92/2.11 ** KEPT (pick-wt=10): 5 [] c_in(c_Pair(v_a,v_b,t_a,t_a),v_r,tc_prod(t_a,t_a)).
% 1.92/2.11 ** KEPT (pick-wt=10): 6 [] c_in(c_Pair(v_b,v_c,t_a,t_a),v_r,tc_prod(t_a,t_a)).
% 1.92/2.11 ** KEPT (pick-wt=6): 7 [] c_in(v_cl,c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit)).
% 1.92/2.11 ** KEPT (pick-wt=6): 9 [copy,8,flip.1] c_Tarski_Opotype_Oorder(v_cl,t_a,tc_Product__Type_Ounit)=v_r.
% 1.92/2.11 ---> New Demodulator: 10 [new_demod,9] c_Tarski_Opotype_Oorder(v_cl,t_a,tc_Product__Type_Ounit)=v_r.
% 1.92/2.11 Following clause subsumed by 4 during input processing: 0 [copy,4,flip.1] A=A.
% 1.92/2.11 >>>> Starting back demodulation with 10.
% 1.92/2.11
% 1.92/2.11 ======= end of input processing =======
% 1.92/2.11
% 1.92/2.11 =========== start of search ===========
% 1.92/2.11
% 1.92/2.11 -------- PROOF --------
% 1.92/2.11
% 1.92/2.11 ----> UNIT CONFLICT at 0.00 sec ----> 13 [binary,12.1,1.1] $F.
% 1.92/2.11
% 1.92/2.11 Length of proof is 3. Level of proof is 3.
% 1.92/2.11
% 1.92/2.11 ---------------- PROOF ----------------
% 1.92/2.11 % SZS status Unsatisfiable
% 1.92/2.11 % SZS output start Refutation
% See solution above
% 1.92/2.11 ------------ end of proof -------------
% 1.92/2.11
% 1.92/2.11
% 1.92/2.11 Search stopped by max_proofs option.
% 1.92/2.11
% 1.92/2.11
% 1.92/2.11 Search stopped by max_proofs option.
% 1.92/2.11
% 1.92/2.11 ============ end of search ============
% 1.92/2.11
% 1.92/2.11 -------------- statistics -------------
% 1.92/2.11 clauses given 6
% 1.92/2.11 clauses generated 5
% 1.92/2.11 clauses kept 10
% 1.92/2.11 clauses forward subsumed 4
% 1.92/2.11 clauses back subsumed 0
% 1.92/2.11 Kbytes malloced 976
% 1.92/2.11
% 1.92/2.11 ----------- times (seconds) -----------
% 1.92/2.11 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.92/2.11 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.92/2.11 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.92/2.11
% 1.92/2.11 That finishes the proof of the theorem.
% 1.92/2.11
% 1.92/2.11 Process 14593 finished Wed Jul 27 08:14:33 2022
% 1.92/2.11 Otter interrupted
% 1.92/2.11 PROOF FOUND
%------------------------------------------------------------------------------