TSTP Solution File: COM011-2 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : COM011-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 12:48:21 EDT 2022
% Result : Unsatisfiable 1.68s 1.90s
% Output : Refutation 1.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 10
% Syntax : Number of clauses : 23 ( 10 unt; 7 nHn; 16 RR)
% Number of literals : 39 ( 0 equ; 10 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 13 ( 13 usr; 4 con; 0-3 aty)
% Number of variables : 35 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ c_in(v_F,c_WFair_OleadsTo(v_A,v_B,t_a),tc_UNITY_Oprogram(t_a)),
file('COM011-2.p',unknown),
[] ).
cnf(2,axiom,
( ~ c_in(A,c_minus(B,C,tc_set(D)),D)
| c_in(A,B,D) ),
file('COM011-2.p',unknown),
[] ).
cnf(3,axiom,
( ~ c_in(c_Main_OsubsetI__1(A,B,C),B,C)
| c_lesse_quals(A,B,tc_set(C)) ),
file('COM011-2.p',unknown),
[] ).
cnf(4,axiom,
( ~ c_in(A,c_UNITY_Oconstrains(B,C,D),tc_UNITY_Oprogram(D))
| ~ c_lesse_quals(E,B,tc_set(D))
| c_in(A,c_UNITY_Oconstrains(E,C,D),tc_UNITY_Oprogram(D)) ),
file('COM011-2.p',unknown),
[] ).
cnf(5,axiom,
( ~ c_in(A,c_UNITY_Oconstrains(c_minus(B,C,tc_set(D)),c_union(B,C,D),D),tc_UNITY_Oprogram(D))
| ~ c_in(A,c_WFair_Otransient(c_minus(B,C,tc_set(D)),D),tc_UNITY_Oprogram(D))
| c_in(A,c_WFair_Oensures(B,C,D),tc_UNITY_Oprogram(D)) ),
file('COM011-2.p',unknown),
[] ).
cnf(6,axiom,
( ~ c_in(A,c_WFair_Oensures(B,C,D),tc_UNITY_Oprogram(D))
| c_in(A,c_WFair_OleadsTo(B,C,D),tc_UNITY_Oprogram(D)) ),
file('COM011-2.p',unknown),
[] ).
cnf(7,axiom,
( ~ c_in(A,c_WFair_Otransient(B,C),tc_UNITY_Oprogram(C))
| ~ c_lesse_quals(D,B,tc_set(C))
| c_in(A,c_WFair_Otransient(D,C),tc_UNITY_Oprogram(C)) ),
file('COM011-2.p',unknown),
[] ).
cnf(8,axiom,
c_in(v_F,c_UNITY_Oconstrains(v_A,c_union(v_A,v_B,t_a),t_a),tc_UNITY_Oprogram(t_a)),
file('COM011-2.p',unknown),
[] ).
cnf(9,axiom,
c_in(v_F,c_WFair_Otransient(v_A,t_a),tc_UNITY_Oprogram(t_a)),
file('COM011-2.p',unknown),
[] ).
cnf(10,axiom,
( c_in(c_Main_OsubsetI__1(A,B,C),A,C)
| c_lesse_quals(A,B,tc_set(C)) ),
file('COM011-2.p',unknown),
[] ).
cnf(11,plain,
( c_in(c_Main_OsubsetI__1(A,v_A,t_a),A,t_a)
| c_in(v_F,c_WFair_Otransient(A,t_a),tc_UNITY_Oprogram(t_a)) ),
inference(hyper,[status(thm)],[10,7,9]),
[iquote('hyper,10,7,9')] ).
cnf(12,plain,
( c_in(c_Main_OsubsetI__1(A,v_A,t_a),A,t_a)
| c_in(v_F,c_UNITY_Oconstrains(A,c_union(v_A,v_B,t_a),t_a),tc_UNITY_Oprogram(t_a)) ),
inference(hyper,[status(thm)],[10,4,8]),
[iquote('hyper,10,4,8')] ).
cnf(13,plain,
( c_in(v_F,c_WFair_Otransient(c_minus(A,B,tc_set(t_a)),t_a),tc_UNITY_Oprogram(t_a))
| c_in(c_Main_OsubsetI__1(c_minus(A,B,tc_set(t_a)),v_A,t_a),A,t_a) ),
inference(hyper,[status(thm)],[11,2]),
[iquote('hyper,11,2')] ).
cnf(15,plain,
( c_in(v_F,c_UNITY_Oconstrains(c_minus(A,B,tc_set(t_a)),c_union(v_A,v_B,t_a),t_a),tc_UNITY_Oprogram(t_a))
| c_in(c_Main_OsubsetI__1(c_minus(A,B,tc_set(t_a)),v_A,t_a),A,t_a) ),
inference(hyper,[status(thm)],[12,2]),
[iquote('hyper,12,2')] ).
cnf(19,plain,
( c_in(v_F,c_WFair_Otransient(c_minus(v_A,A,tc_set(t_a)),t_a),tc_UNITY_Oprogram(t_a))
| c_lesse_quals(c_minus(v_A,A,tc_set(t_a)),v_A,tc_set(t_a)) ),
inference(hyper,[status(thm)],[13,3]),
[iquote('hyper,13,3')] ).
cnf(22,plain,
c_in(v_F,c_WFair_Otransient(c_minus(v_A,A,tc_set(t_a)),t_a),tc_UNITY_Oprogram(t_a)),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[19,7,9])]),
[iquote('hyper,19,7,9,factor_simp')] ).
cnf(29,plain,
( c_in(c_Main_OsubsetI__1(c_minus(v_A,v_B,tc_set(t_a)),v_A,t_a),v_A,t_a)
| c_in(v_F,c_WFair_Oensures(v_A,v_B,t_a),tc_UNITY_Oprogram(t_a)) ),
inference(hyper,[status(thm)],[15,5,22]),
[iquote('hyper,15,5,22')] ).
cnf(34,plain,
c_in(c_Main_OsubsetI__1(c_minus(v_A,v_B,tc_set(t_a)),v_A,t_a),v_A,t_a),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[29,6]),1]),
[iquote('hyper,29,6,unit_del,1')] ).
cnf(35,plain,
c_lesse_quals(c_minus(v_A,v_B,tc_set(t_a)),v_A,tc_set(t_a)),
inference(hyper,[status(thm)],[34,3]),
[iquote('hyper,34,3')] ).
cnf(37,plain,
c_in(v_F,c_UNITY_Oconstrains(c_minus(v_A,v_B,tc_set(t_a)),c_union(v_A,v_B,t_a),t_a),tc_UNITY_Oprogram(t_a)),
inference(hyper,[status(thm)],[35,4,8]),
[iquote('hyper,35,4,8')] ).
cnf(39,plain,
c_in(v_F,c_WFair_Oensures(v_A,v_B,t_a),tc_UNITY_Oprogram(t_a)),
inference(hyper,[status(thm)],[37,5,22]),
[iquote('hyper,37,5,22')] ).
cnf(43,plain,
c_in(v_F,c_WFair_OleadsTo(v_A,v_B,t_a),tc_UNITY_Oprogram(t_a)),
inference(hyper,[status(thm)],[39,6]),
[iquote('hyper,39,6')] ).
cnf(44,plain,
$false,
inference(binary,[status(thm)],[43,1]),
[iquote('binary,43.1,1.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : COM011-2 : TPTP v8.1.0. Released v3.2.0.
% 0.03/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 06:38:08 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.68/1.90 ----- Otter 3.3f, August 2004 -----
% 1.68/1.90 The process was started by sandbox on n008.cluster.edu,
% 1.68/1.90 Wed Jul 27 06:38:08 2022
% 1.68/1.90 The command was "./otter". The process ID is 29668.
% 1.68/1.90
% 1.68/1.90 set(prolog_style_variables).
% 1.68/1.90 set(auto).
% 1.68/1.90 dependent: set(auto1).
% 1.68/1.90 dependent: set(process_input).
% 1.68/1.90 dependent: clear(print_kept).
% 1.68/1.90 dependent: clear(print_new_demod).
% 1.68/1.90 dependent: clear(print_back_demod).
% 1.68/1.90 dependent: clear(print_back_sub).
% 1.68/1.90 dependent: set(control_memory).
% 1.68/1.90 dependent: assign(max_mem, 12000).
% 1.68/1.90 dependent: assign(pick_given_ratio, 4).
% 1.68/1.90 dependent: assign(stats_level, 1).
% 1.68/1.90 dependent: assign(max_seconds, 10800).
% 1.68/1.90 clear(print_given).
% 1.68/1.90
% 1.68/1.90 list(usable).
% 1.68/1.90 0 [] c_in(v_F,c_UNITY_Oconstrains(v_A,c_union(v_A,v_B,t_a),t_a),tc_UNITY_Oprogram(t_a)).
% 1.68/1.90 0 [] c_in(v_F,c_WFair_Otransient(v_A,t_a),tc_UNITY_Oprogram(t_a)).
% 1.68/1.90 0 [] -c_in(v_F,c_WFair_OleadsTo(v_A,v_B,t_a),tc_UNITY_Oprogram(t_a)).
% 1.68/1.90 0 [] -c_in(V_c,c_minus(V_A,V_B,tc_set(T_a)),T_a)|c_in(V_c,V_A,T_a).
% 1.68/1.90 0 [] c_in(c_Main_OsubsetI__1(V_A,V_B,T_a),V_A,T_a)|c_lesse_quals(V_A,V_B,tc_set(T_a)).
% 1.68/1.90 0 [] -c_in(c_Main_OsubsetI__1(V_A,V_B,T_a),V_B,T_a)|c_lesse_quals(V_A,V_B,tc_set(T_a)).
% 1.68/1.90 0 [] -c_in(V_F,c_UNITY_Oconstrains(V_A,V_A_H,T_a),tc_UNITY_Oprogram(T_a))| -c_lesse_quals(V_B,V_A,tc_set(T_a))|c_in(V_F,c_UNITY_Oconstrains(V_B,V_A_H,T_a),tc_UNITY_Oprogram(T_a)).
% 1.68/1.90 0 [] -c_in(V_F,c_UNITY_Oconstrains(c_minus(V_A,V_B,tc_set(T_a)),c_union(V_A,V_B,T_a),T_a),tc_UNITY_Oprogram(T_a))| -c_in(V_F,c_WFair_Otransient(c_minus(V_A,V_B,tc_set(T_a)),T_a),tc_UNITY_Oprogram(T_a))|c_in(V_F,c_WFair_Oensures(V_A,V_B,T_a),tc_UNITY_Oprogram(T_a)).
% 1.68/1.90 0 [] -c_in(V_F,c_WFair_Oensures(V_A,V_B,T_a),tc_UNITY_Oprogram(T_a))|c_in(V_F,c_WFair_OleadsTo(V_A,V_B,T_a),tc_UNITY_Oprogram(T_a)).
% 1.68/1.90 0 [] -c_in(V_F,c_WFair_Otransient(V_A,T_a),tc_UNITY_Oprogram(T_a))| -c_lesse_quals(V_B,V_A,tc_set(T_a))|c_in(V_F,c_WFair_Otransient(V_B,T_a),tc_UNITY_Oprogram(T_a)).
% 1.68/1.90 end_of_list.
% 1.68/1.90
% 1.68/1.90 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=3.
% 1.68/1.90
% 1.68/1.90 This is a non-Horn set without equality. The strategy will
% 1.68/1.90 be ordered hyper_res, unit deletion, and factoring, with
% 1.68/1.90 satellites in sos and with nuclei in usable.
% 1.68/1.90
% 1.68/1.90 dependent: set(hyper_res).
% 1.68/1.90 dependent: set(factor).
% 1.68/1.90 dependent: set(unit_deletion).
% 1.68/1.90
% 1.68/1.90 ------------> process usable:
% 1.68/1.90 ** KEPT (pick-wt=8): 1 [] -c_in(v_F,c_WFair_OleadsTo(v_A,v_B,t_a),tc_UNITY_Oprogram(t_a)).
% 1.68/1.90 ** KEPT (pick-wt=12): 2 [] -c_in(A,c_minus(B,C,tc_set(D)),D)|c_in(A,B,D).
% 1.68/1.90 ** KEPT (pick-wt=12): 3 [] -c_in(c_Main_OsubsetI__1(A,B,C),B,C)|c_lesse_quals(A,B,tc_set(C)).
% 1.68/1.90 ** KEPT (pick-wt=21): 4 [] -c_in(A,c_UNITY_Oconstrains(B,C,D),tc_UNITY_Oprogram(D))| -c_lesse_quals(E,B,tc_set(D))|c_in(A,c_UNITY_Oconstrains(E,C,D),tc_UNITY_Oprogram(D)).
% 1.68/1.90 ** KEPT (pick-wt=34): 5 [] -c_in(A,c_UNITY_Oconstrains(c_minus(B,C,tc_set(D)),c_union(B,C,D),D),tc_UNITY_Oprogram(D))| -c_in(A,c_WFair_Otransient(c_minus(B,C,tc_set(D)),D),tc_UNITY_Oprogram(D))|c_in(A,c_WFair_Oensures(B,C,D),tc_UNITY_Oprogram(D)).
% 1.68/1.90 ** KEPT (pick-wt=16): 6 [] -c_in(A,c_WFair_Oensures(B,C,D),tc_UNITY_Oprogram(D))|c_in(A,c_WFair_OleadsTo(B,C,D),tc_UNITY_Oprogram(D)).
% 1.68/1.90 ** KEPT (pick-wt=19): 7 [] -c_in(A,c_WFair_Otransient(B,C),tc_UNITY_Oprogram(C))| -c_lesse_quals(D,B,tc_set(C))|c_in(A,c_WFair_Otransient(D,C),tc_UNITY_Oprogram(C)).
% 1.68/1.90
% 1.68/1.90 ------------> process sos:
% 1.68/1.90 ** KEPT (pick-wt=11): 8 [] c_in(v_F,c_UNITY_Oconstrains(v_A,c_union(v_A,v_B,t_a),t_a),tc_UNITY_Oprogram(t_a)).
% 1.68/1.90 ** KEPT (pick-wt=7): 9 [] c_in(v_F,c_WFair_Otransient(v_A,t_a),tc_UNITY_Oprogram(t_a)).
% 1.68/1.90 ** KEPT (pick-wt=12): 10 [] c_in(c_Main_OsubsetI__1(A,B,C),A,C)|c_lesse_quals(A,B,tc_set(C)).
% 1.68/1.90
% 1.68/1.90 ======= end of input processing =======
% 1.68/1.90
% 1.68/1.90 =========== start of search ===========
% 1.68/1.90
% 1.68/1.90 -------- PROOF --------
% 1.68/1.90
% 1.68/1.90 ----> UNIT CONFLICT at 0.00 sec ----> 44 [binary,43.1,1.1] $F.
% 1.68/1.90
% 1.68/1.90 Length of proof is 12. Level of proof is 10.
% 1.68/1.90
% 1.68/1.90 ---------------- PROOF ----------------
% 1.68/1.90 % SZS status Unsatisfiable
% 1.68/1.90 % SZS output start Refutation
% See solution above
% 1.68/1.90 ------------ end of proof -------------
% 1.68/1.90
% 1.68/1.90
% 1.68/1.90 Search stopped by max_proofs option.
% 1.68/1.90
% 1.68/1.90
% 1.68/1.90 Search stopped by max_proofs option.
% 1.68/1.90
% 1.68/1.90 ============ end of search ============
% 1.68/1.90
% 1.68/1.90 -------------- statistics -------------
% 1.68/1.90 clauses given 17
% 1.68/1.90 clauses generated 73
% 1.68/1.90 clauses kept 43
% 1.68/1.90 clauses forward subsumed 40
% 1.68/1.90 clauses back subsumed 8
% 1.68/1.90 Kbytes malloced 976
% 1.68/1.90
% 1.68/1.90 ----------- times (seconds) -----------
% 1.68/1.90 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.68/1.90 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.68/1.90 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.68/1.90
% 1.68/1.90 That finishes the proof of the theorem.
% 1.68/1.90
% 1.68/1.90 Process 29668 finished Wed Jul 27 06:38:10 2022
% 1.68/1.90 Otter interrupted
% 1.68/1.90 PROOF FOUND
%------------------------------------------------------------------------------