TSTP Solution File: LAT266-2 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LAT266-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n019.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:14 EDT 2022
% Result : Unsatisfiable 1.65s 1.87s
% Output : Refutation 1.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 8 ( 8 unt; 0 nHn; 7 RR)
% Number of literals : 8 ( 3 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-3 aty)
% Number of variables : 2 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ c_lesse_quals(v_S,c_Tarski_Opotype_Opset(c_Tarski_Odual(v_cl,t_a),t_a,tc_Product__Type_Ounit),tc_set(t_a)),
file('LAT266-2.p',unknown),
[] ).
cnf(3,axiom,
c_lesse_quals(v_S,c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit),tc_set(t_a)),
file('LAT266-2.p',unknown),
[] ).
cnf(4,axiom,
v_A = c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit),
file('LAT266-2.p',unknown),
[] ).
cnf(6,plain,
c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit) = v_A,
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[4])]),
[iquote('copy,4,flip.1')] ).
cnf(8,axiom,
c_Tarski_Opotype_Opset(c_Tarski_Odual(A,B),B,tc_Product__Type_Ounit) = c_Tarski_Opotype_Opset(A,B,tc_Product__Type_Ounit),
file('LAT266-2.p',unknown),
[] ).
cnf(9,plain,
c_lesse_quals(v_S,v_A,tc_set(t_a)),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[3]),6]),
[iquote('back_demod,3,demod,6')] ).
cnf(10,plain,
~ c_lesse_quals(v_S,v_A,tc_set(t_a)),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[1]),8,6]),
[iquote('back_demod,1,demod,8,6')] ).
cnf(11,plain,
$false,
inference(binary,[status(thm)],[10,9]),
[iquote('binary,10.1,9.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LAT266-2 : TPTP v8.1.0. Released v3.2.0.
% 0.11/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n019.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:36:07 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.65/1.87
% 1.65/1.87 -------- PROOF --------
% 1.65/1.87 ----- Otter 3.3f, August 2004 -----
% 1.65/1.87 The process was started by sandbox2 on n019.cluster.edu,
% 1.65/1.87 Wed Jul 27 08:36:07 2022
% 1.65/1.87 The command was "./otter". The process ID is 29065.
% 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 [] c_lesse_quals(v_S,c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit),tc_set(t_a)).
% 1.65/1.87 0 [] -c_lesse_quals(v_S,c_Tarski_Opotype_Opset(c_Tarski_Odual(v_cl,t_a),t_a,tc_Product__Type_Ounit),tc_set(t_a)).
% 1.65/1.87 0 [] v_A=c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit).
% 1.65/1.87 0 [] c_Tarski_Opotype_Opset(c_Tarski_Odual(V_cl,T_a),T_a,tc_Product__Type_Ounit)=c_Tarski_Opotype_Opset(V_cl,T_a,tc_Product__Type_Ounit).
% 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=10): 1 [] -c_lesse_quals(v_S,c_Tarski_Opotype_Opset(c_Tarski_Odual(v_cl,t_a),t_a,tc_Product__Type_Ounit),tc_set(t_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=8): 3 [] c_lesse_quals(v_S,c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit),tc_set(t_a)).
% 1.65/1.87 ** KEPT (pick-wt=6): 5 [copy,4,flip.1] c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit)=v_A.
% 1.65/1.87 ---> New Demodulator: 6 [new_demod,5] c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit)=v_A.
% 1.65/1.87 ** KEPT (pick-wt=11): 7 [] c_Tarski_Opotype_Opset(c_Tarski_Odual(A,B),B,tc_Product__Type_Ounit)=c_Tarski_Opotype_Opset(A,B,tc_Product__Type_Ounit).
% 1.65/1.87 ---> New Demodulator: 8 [new_demod,7] c_Tarski_Opotype_Opset(c_Tarski_Odual(A,B),B,tc_Product__Type_Ounit)=c_Tarski_Opotype_Opset(A,B,tc_Product__Type_Ounit).
% 1.65/1.87 Following clause subsumed by 2 during input processing: 0 [copy,2,flip.1] A=A.
% 1.65/1.87 >>>> Starting back demodulation with 6.
% 1.65/1.87 >> back demodulating 3 with 6.
% 1.65/1.87 >>>> Starting back demodulation with 8.
% 1.65/1.87 >> back demodulating 1 with 8.
% 1.65/1.87
% 1.65/1.87 ----> UNIT CONFLICT at 0.00 sec ----> 11 [binary,10.1,9.1] $F.
% 1.65/1.87
% 1.65/1.87 Length of proof is 3. Level of proof is 2.
% 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 0
% 1.65/1.87 clauses generated 0
% 1.65/1.87 clauses kept 7
% 1.65/1.87 clauses forward subsumed 1
% 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 1 (0 hr, 0 min, 1 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 29065 finished Wed Jul 27 08:36:08 2022
% 1.65/1.87 Otter interrupted
% 1.65/1.87 PROOF FOUND
%------------------------------------------------------------------------------