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