TSTP Solution File: COM010-2 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : COM010-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n027.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 : 11 ( 11 unt; 0 nHn; 10 RR)
% Number of literals : 11 ( 10 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 3 con; 0-4 aty)
% Number of variables : 2 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
v_F != v_G,
file('COM010-2.p',unknown),
[] ).
cnf(2,plain,
v_G != v_F,
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[1])]),
[iquote('copy,1,flip.1')] ).
cnf(4,axiom,
c_UNITY_OInit(v_F,t_a) = c_UNITY_OInit(v_G,t_a),
file('COM010-2.p',unknown),
[] ).
cnf(5,plain,
c_UNITY_OInit(v_G,t_a) = c_UNITY_OInit(v_F,t_a),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[4])]),
[iquote('copy,4,flip.1')] ).
cnf(7,axiom,
c_UNITY_OActs(v_F,t_a) = c_UNITY_OActs(v_G,t_a),
file('COM010-2.p',unknown),
[] ).
cnf(9,plain,
c_UNITY_OActs(v_G,t_a) = c_UNITY_OActs(v_F,t_a),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[7])]),
[iquote('copy,7,flip.1')] ).
cnf(10,axiom,
c_UNITY_OAllowedActs(v_F,t_a) = c_UNITY_OAllowedActs(v_G,t_a),
file('COM010-2.p',unknown),
[] ).
cnf(12,plain,
c_UNITY_OAllowedActs(v_G,t_a) = c_UNITY_OAllowedActs(v_F,t_a),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[10])]),
[iquote('copy,10,flip.1')] ).
cnf(14,axiom,
c_UNITY_Omk__program(c_Pair(c_UNITY_OInit(A,B),c_Pair(c_UNITY_OActs(A,B),c_UNITY_OAllowedActs(A,B),tc_set(tc_set(tc_prod(B,B))),tc_set(tc_set(tc_prod(B,B)))),tc_set(B),tc_prod(tc_set(tc_set(tc_prod(B,B))),tc_set(tc_set(tc_prod(B,B))))),B) = A,
file('COM010-2.p',unknown),
[] ).
cnf(15,plain,
v_G = v_F,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[14,5]),9,12,14])]),
[iquote('para_into,13.1.1.1.1,5.1.1,demod,9,12,14,flip.1')] ).
cnf(17,plain,
$false,
inference(binary,[status(thm)],[15,2]),
[iquote('binary,15.1,2.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : COM010-2 : TPTP v8.1.0. Released v3.2.0.
% 0.10/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n027.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:48:06 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 n027.cluster.edu,
% 1.67/1.88 Wed Jul 27 06:48:06 2022
% 1.67/1.88 The command was "./otter". The process ID is 8693.
% 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_OInit(v_F,t_a)=c_UNITY_OInit(v_G,t_a).
% 1.67/1.88 0 [] c_UNITY_OActs(v_F,t_a)=c_UNITY_OActs(v_G,t_a).
% 1.67/1.88 0 [] c_UNITY_OAllowedActs(v_F,t_a)=c_UNITY_OAllowedActs(v_G,t_a).
% 1.67/1.88 0 [] v_F!=v_G.
% 1.67/1.88 0 [] c_UNITY_Omk__program(c_Pair(c_UNITY_OInit(V_y,T_a),c_Pair(c_UNITY_OActs(V_y,T_a),c_UNITY_OAllowedActs(V_y,T_a),tc_set(tc_set(tc_prod(T_a,T_a))),tc_set(tc_set(tc_prod(T_a,T_a)))),tc_set(T_a),tc_prod(tc_set(tc_set(tc_prod(T_a,T_a))),tc_set(tc_set(tc_prod(T_a,T_a))))),T_a)=V_y.
% 1.67/1.88 end_of_list.
% 1.67/1.88
% 1.67/1.88 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 1.67/1.88
% 1.67/1.88 All clauses are units, and equality is present; the
% 1.67/1.88 strategy will be Knuth-Bendix with positive clauses in sos.
% 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
% 1.67/1.88 ------------> process usable:
% 1.67/1.88 ** KEPT (pick-wt=3): 2 [copy,1,flip.1] v_G!=v_F.
% 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=7): 5 [copy,4,flip.1] c_UNITY_OInit(v_G,t_a)=c_UNITY_OInit(v_F,t_a).
% 1.67/1.88 ---> New Demodulator: 6 [new_demod,5] c_UNITY_OInit(v_G,t_a)=c_UNITY_OInit(v_F,t_a).
% 1.67/1.88 ** KEPT (pick-wt=7): 8 [copy,7,flip.1] c_UNITY_OActs(v_G,t_a)=c_UNITY_OActs(v_F,t_a).
% 1.67/1.88 ---> New Demodulator: 9 [new_demod,8] c_UNITY_OActs(v_G,t_a)=c_UNITY_OActs(v_F,t_a).
% 1.67/1.88 ** KEPT (pick-wt=7): 11 [copy,10,flip.1] c_UNITY_OAllowedActs(v_G,t_a)=c_UNITY_OAllowedActs(v_F,t_a).
% 1.67/1.88 ---> New Demodulator: 12 [new_demod,11] c_UNITY_OAllowedActs(v_G,t_a)=c_UNITY_OAllowedActs(v_F,t_a).
% 1.67/1.88 ** KEPT (pick-wt=38): 13 [] c_UNITY_Omk__program(c_Pair(c_UNITY_OInit(A,B),c_Pair(c_UNITY_OActs(A,B),c_UNITY_OAllowedActs(A,B),tc_set(tc_set(tc_prod(B,B))),tc_set(tc_set(tc_prod(B,B)))),tc_set(B),tc_prod(tc_set(tc_set(tc_prod(B,B))),tc_set(tc_set(tc_prod(B,B))))),B)=A.
% 1.67/1.88 ---> New Demodulator: 14 [new_demod,13] c_UNITY_Omk__program(c_Pair(c_UNITY_OInit(A,B),c_Pair(c_UNITY_OActs(A,B),c_UNITY_OAllowedActs(A,B),tc_set(tc_set(tc_prod(B,B))),tc_set(tc_set(tc_prod(B,B)))),tc_set(B),tc_prod(tc_set(tc_set(tc_prod(B,B))),tc_set(tc_set(tc_prod(B,B))))),B)=A.
% 1.67/1.88 Following clause subsumed by 3 during input processing: 0 [copy,3,flip.1] A=A.
% 1.67/1.88 >>>> Starting back demodulation with 6.
% 1.67/1.88 >>>> Starting back demodulation with 9.
% 1.67/1.88 >>>> Starting back demodulation with 12.
% 1.67/1.88 >>>> Starting back demodulation with 14.
% 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 ----> 17 [binary,15.1,2.1] $F.
% 1.67/1.88
% 1.67/1.88 Length of proof is 5. 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 7
% 1.67/1.88 clauses forward subsumed 7
% 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 8693 finished Wed Jul 27 06:48:08 2022
% 1.67/1.88 Otter interrupted
% 1.67/1.88 PROOF FOUND
%------------------------------------------------------------------------------