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