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