TSTP Solution File: SWV239-2 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SWV239-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n010.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:15 EDT 2022
% Result : Unsatisfiable 1.51s 1.69s
% Output : Refutation 1.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of clauses : 12 ( 7 unt; 2 nHn; 8 RR)
% Number of literals : 18 ( 0 equ; 5 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-3 aty)
% Number of variables : 18 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ c_lesse_quals(c_Message_Oanalz(c_union(c_Message_Oanalz(v_G),v_H,tc_Message_Omsg)),c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg)),
file('SWV239-2.p',unknown),
[] ).
cnf(2,axiom,
( ~ c_in(A,c_Message_Oanalz(c_Message_Oanalz(B)),tc_Message_Omsg)
| c_in(A,c_Message_Oanalz(B),tc_Message_Omsg) ),
file('SWV239-2.p',unknown),
[] ).
cnf(3,axiom,
( ~ c_lesse_quals(c_Message_Oanalz(A),c_Message_Oanalz(B),tc_set(tc_Message_Omsg))
| ~ c_lesse_quals(c_Message_Oanalz(C),c_Message_Oanalz(D),tc_set(tc_Message_Omsg))
| c_lesse_quals(c_Message_Oanalz(c_union(C,A,tc_Message_Omsg)),c_Message_Oanalz(c_union(D,B,tc_Message_Omsg)),tc_set(tc_Message_Omsg)) ),
file('SWV239-2.p',unknown),
[] ).
cnf(4,axiom,
( ~ c_in(c_Main_OsubsetI__1(A,B,C),B,C)
| c_lesse_quals(A,B,tc_set(C)) ),
file('SWV239-2.p',unknown),
[] ).
cnf(6,axiom,
( c_in(c_Main_OsubsetI__1(A,B,C),A,C)
| c_lesse_quals(A,B,tc_set(C)) ),
file('SWV239-2.p',unknown),
[] ).
cnf(7,axiom,
c_lesse_quals(A,A,tc_set(B)),
file('SWV239-2.p',unknown),
[] ).
cnf(12,plain,
( c_lesse_quals(c_Message_Oanalz(c_union(A,B,tc_Message_Omsg)),c_Message_Oanalz(c_union(C,B,tc_Message_Omsg)),tc_set(tc_Message_Omsg))
| c_in(c_Main_OsubsetI__1(c_Message_Oanalz(A),c_Message_Oanalz(C),tc_Message_Omsg),c_Message_Oanalz(A),tc_Message_Omsg) ),
inference(hyper,[status(thm)],[7,3,6]),
[iquote('hyper,7,3,6')] ).
cnf(89,plain,
c_in(c_Main_OsubsetI__1(c_Message_Oanalz(c_Message_Oanalz(v_G)),c_Message_Oanalz(v_G),tc_Message_Omsg),c_Message_Oanalz(c_Message_Oanalz(v_G)),tc_Message_Omsg),
inference(hyper,[status(thm)],[12,1]),
[iquote('hyper,12,1')] ).
cnf(101,plain,
c_in(c_Main_OsubsetI__1(c_Message_Oanalz(c_Message_Oanalz(v_G)),c_Message_Oanalz(v_G),tc_Message_Omsg),c_Message_Oanalz(v_G),tc_Message_Omsg),
inference(hyper,[status(thm)],[89,2]),
[iquote('hyper,89,2')] ).
cnf(102,plain,
c_lesse_quals(c_Message_Oanalz(c_Message_Oanalz(v_G)),c_Message_Oanalz(v_G),tc_set(tc_Message_Omsg)),
inference(hyper,[status(thm)],[101,4]),
[iquote('hyper,101,4')] ).
cnf(108,plain,
c_lesse_quals(c_Message_Oanalz(c_union(c_Message_Oanalz(v_G),A,tc_Message_Omsg)),c_Message_Oanalz(c_union(v_G,A,tc_Message_Omsg)),tc_set(tc_Message_Omsg)),
inference(hyper,[status(thm)],[102,3,7]),
[iquote('hyper,102,3,7')] ).
cnf(109,plain,
$false,
inference(binary,[status(thm)],[108,1]),
[iquote('binary,108.1,1.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SWV239-2 : TPTP v8.1.0. Released v3.2.0.
% 0.10/0.12 % Command : otter-tptp-script %s
% 0.11/0.33 % Computer : n010.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Wed Jul 27 05:58:24 EDT 2022
% 0.11/0.33 % CPUTime :
% 1.51/1.69 ----- Otter 3.3f, August 2004 -----
% 1.51/1.69 The process was started by sandbox on n010.cluster.edu,
% 1.51/1.69 Wed Jul 27 05:58:25 2022
% 1.51/1.69 The command was "./otter". The process ID is 4360.
% 1.51/1.69
% 1.51/1.69 set(prolog_style_variables).
% 1.51/1.69 set(auto).
% 1.51/1.69 dependent: set(auto1).
% 1.51/1.69 dependent: set(process_input).
% 1.51/1.69 dependent: clear(print_kept).
% 1.51/1.69 dependent: clear(print_new_demod).
% 1.51/1.69 dependent: clear(print_back_demod).
% 1.51/1.69 dependent: clear(print_back_sub).
% 1.51/1.69 dependent: set(control_memory).
% 1.51/1.69 dependent: assign(max_mem, 12000).
% 1.51/1.69 dependent: assign(pick_given_ratio, 4).
% 1.51/1.69 dependent: assign(stats_level, 1).
% 1.51/1.69 dependent: assign(max_seconds, 10800).
% 1.51/1.69 clear(print_given).
% 1.51/1.69
% 1.51/1.69 list(usable).
% 1.51/1.69 0 [] -c_lesse_quals(c_Message_Oanalz(c_union(c_Message_Oanalz(v_G),v_H,tc_Message_Omsg)),c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg)).
% 1.51/1.69 0 [] -c_in(V_X,c_Message_Oanalz(c_Message_Oanalz(V_H)),tc_Message_Omsg)|c_in(V_X,c_Message_Oanalz(V_H),tc_Message_Omsg).
% 1.51/1.69 0 [] -c_lesse_quals(c_Message_Oanalz(V_H),c_Message_Oanalz(V_H_H),tc_set(tc_Message_Omsg))| -c_lesse_quals(c_Message_Oanalz(V_G),c_Message_Oanalz(V_G_H),tc_set(tc_Message_Omsg))|c_lesse_quals(c_Message_Oanalz(c_union(V_G,V_H,tc_Message_Omsg)),c_Message_Oanalz(c_union(V_G_H,V_H_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg)).
% 1.51/1.69 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.51/1.69 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.51/1.69 0 [] c_lesse_quals(V_A,V_A,tc_set(T_a)).
% 1.51/1.69 end_of_list.
% 1.51/1.69
% 1.51/1.69 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=3.
% 1.51/1.69
% 1.51/1.69 This is a non-Horn set without equality. The strategy will
% 1.51/1.69 be ordered hyper_res, unit deletion, and factoring, with
% 1.51/1.69 satellites in sos and with nuclei in usable.
% 1.51/1.69
% 1.51/1.69 dependent: set(hyper_res).
% 1.51/1.69 dependent: set(factor).
% 1.51/1.69 dependent: set(unit_deletion).
% 1.51/1.69
% 1.51/1.69 ------------> process usable:
% 1.51/1.69 ** KEPT (pick-wt=14): 1 [] -c_lesse_quals(c_Message_Oanalz(c_union(c_Message_Oanalz(v_G),v_H,tc_Message_Omsg)),c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg)).
% 1.51/1.69 ** KEPT (pick-wt=11): 2 [] -c_in(A,c_Message_Oanalz(c_Message_Oanalz(B)),tc_Message_Omsg)|c_in(A,c_Message_Oanalz(B),tc_Message_Omsg).
% 1.51/1.69 ** KEPT (pick-wt=27): 3 [] -c_lesse_quals(c_Message_Oanalz(A),c_Message_Oanalz(B),tc_set(tc_Message_Omsg))| -c_lesse_quals(c_Message_Oanalz(C),c_Message_Oanalz(D),tc_set(tc_Message_Omsg))|c_lesse_quals(c_Message_Oanalz(c_union(C,A,tc_Message_Omsg)),c_Message_Oanalz(c_union(D,B,tc_Message_Omsg)),tc_set(tc_Message_Omsg)).
% 1.51/1.69 ** KEPT (pick-wt=12): 4 [] -c_in(c_Main_OsubsetI__1(A,B,C),B,C)|c_lesse_quals(A,B,tc_set(C)).
% 1.51/1.69
% 1.51/1.69 ------------> process sos:
% 1.51/1.69 ** KEPT (pick-wt=12): 6 [] c_in(c_Main_OsubsetI__1(A,B,C),A,C)|c_lesse_quals(A,B,tc_set(C)).
% 1.51/1.69 ** KEPT (pick-wt=5): 7 [] c_lesse_quals(A,A,tc_set(B)).
% 1.51/1.69
% 1.51/1.69 ======= end of input processing =======
% 1.51/1.69
% 1.51/1.69 =========== start of search ===========
% 1.51/1.69
% 1.51/1.69 -------- PROOF --------
% 1.51/1.69
% 1.51/1.69 ----> UNIT CONFLICT at 0.02 sec ----> 109 [binary,108.1,1.1] $F.
% 1.51/1.69
% 1.51/1.69 Length of proof is 5. Level of proof is 5.
% 1.51/1.69
% 1.51/1.69 ---------------- PROOF ----------------
% 1.51/1.69 % SZS status Unsatisfiable
% 1.51/1.69 % SZS output start Refutation
% See solution above
% 1.51/1.69 ------------ end of proof -------------
% 1.51/1.69
% 1.51/1.69
% 1.51/1.69 Search stopped by max_proofs option.
% 1.51/1.69
% 1.51/1.69
% 1.51/1.69 Search stopped by max_proofs option.
% 1.51/1.69
% 1.51/1.69 ============ end of search ============
% 1.51/1.69
% 1.51/1.69 -------------- statistics -------------
% 1.51/1.69 clauses given 14
% 1.51/1.69 clauses generated 170
% 1.51/1.69 clauses kept 108
% 1.51/1.69 clauses forward subsumed 68
% 1.51/1.69 clauses back subsumed 17
% 1.51/1.69 Kbytes malloced 976
% 1.51/1.69
% 1.51/1.69 ----------- times (seconds) -----------
% 1.51/1.69 user CPU time 0.02 (0 hr, 0 min, 0 sec)
% 1.51/1.69 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.51/1.69 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.51/1.69
% 1.51/1.69 That finishes the proof of the theorem.
% 1.51/1.69
% 1.51/1.69 Process 4360 finished Wed Jul 27 05:58:26 2022
% 1.51/1.69 Otter interrupted
% 1.51/1.69 PROOF FOUND
%------------------------------------------------------------------------------