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