TSTP Solution File: SWV243-2 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SWV243-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 13:20:16 EDT 2022
% Result : Unsatisfiable 1.62s 1.84s
% Output : Refutation 1.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 3
% Syntax : Number of clauses : 5 ( 5 unt; 0 nHn; 2 RR)
% Number of literals : 5 ( 4 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-3 aty)
% Number of variables : 5 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
c_Message_Oanalz(c_Message_Osynth(v_H)) != c_union(c_Message_Oanalz(v_H),c_Message_Osynth(v_H),tc_Message_Omsg),
file('SWV243-2.p',unknown),
[] ).
cnf(3,axiom,
c_Message_Oanalz(c_union(c_Message_Osynth(A),B,tc_Message_Omsg)) = c_union(c_Message_Oanalz(c_union(A,B,tc_Message_Omsg)),c_Message_Osynth(A),tc_Message_Omsg),
file('SWV243-2.p',unknown),
[] ).
cnf(6,axiom,
c_union(A,c_emptyset,B) = A,
file('SWV243-2.p',unknown),
[] ).
cnf(7,plain,
c_Message_Oanalz(c_Message_Osynth(A)) = c_union(c_Message_Oanalz(A),c_Message_Osynth(A),tc_Message_Omsg),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[3,6]),6]),
[iquote('para_into,3.1.1.1,5.1.1,demod,6')] ).
cnf(9,plain,
$false,
inference(binary,[status(thm)],[7,1]),
[iquote('binary,7.1,1.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWV243-2 : TPTP v8.1.0. Released v3.2.0.
% 0.11/0.12 % Command : otter-tptp-script %s
% 0.12/0.34 % Computer : n005.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Wed Jul 27 05:45:20 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.62/1.84 ----- Otter 3.3f, August 2004 -----
% 1.62/1.84 The process was started by sandbox2 on n005.cluster.edu,
% 1.62/1.84 Wed Jul 27 05:45:20 2022
% 1.62/1.84 The command was "./otter". The process ID is 30581.
% 1.62/1.84
% 1.62/1.84 set(prolog_style_variables).
% 1.62/1.84 set(auto).
% 1.62/1.84 dependent: set(auto1).
% 1.62/1.84 dependent: set(process_input).
% 1.62/1.84 dependent: clear(print_kept).
% 1.62/1.84 dependent: clear(print_new_demod).
% 1.62/1.84 dependent: clear(print_back_demod).
% 1.62/1.84 dependent: clear(print_back_sub).
% 1.62/1.84 dependent: set(control_memory).
% 1.62/1.84 dependent: assign(max_mem, 12000).
% 1.62/1.84 dependent: assign(pick_given_ratio, 4).
% 1.62/1.84 dependent: assign(stats_level, 1).
% 1.62/1.84 dependent: assign(max_seconds, 10800).
% 1.62/1.84 clear(print_given).
% 1.62/1.84
% 1.62/1.84 list(usable).
% 1.62/1.84 0 [] A=A.
% 1.62/1.84 0 [] c_Message_Oanalz(c_Message_Osynth(v_H))!=c_union(c_Message_Oanalz(v_H),c_Message_Osynth(v_H),tc_Message_Omsg).
% 1.62/1.84 0 [] c_Message_Oanalz(c_union(c_Message_Osynth(V_G),V_H,tc_Message_Omsg))=c_union(c_Message_Oanalz(c_union(V_G,V_H,tc_Message_Omsg)),c_Message_Osynth(V_G),tc_Message_Omsg).
% 1.62/1.84 0 [] c_union(V_y,c_emptyset,T_a)=V_y.
% 1.62/1.84 end_of_list.
% 1.62/1.84
% 1.62/1.84 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 1.62/1.84
% 1.62/1.84 All clauses are units, and equality is present; the
% 1.62/1.84 strategy will be Knuth-Bendix with positive clauses in sos.
% 1.62/1.84
% 1.62/1.84 dependent: set(knuth_bendix).
% 1.62/1.84 dependent: set(anl_eq).
% 1.62/1.84 dependent: set(para_from).
% 1.62/1.84 dependent: set(para_into).
% 1.62/1.84 dependent: clear(para_from_right).
% 1.62/1.84 dependent: clear(para_into_right).
% 1.62/1.84 dependent: set(para_from_vars).
% 1.62/1.84 dependent: set(eq_units_both_ways).
% 1.62/1.84 dependent: set(dynamic_demod_all).
% 1.62/1.84 dependent: set(dynamic_demod).
% 1.62/1.84 dependent: set(order_eq).
% 1.62/1.84 dependent: set(back_demod).
% 1.62/1.84 dependent: set(lrpo).
% 1.62/1.84
% 1.62/1.84 ------------> process usable:
% 1.62/1.84 ** KEPT (pick-wt=10): 1 [] c_Message_Oanalz(c_Message_Osynth(v_H))!=c_union(c_Message_Oanalz(v_H),c_Message_Osynth(v_H),tc_Message_Omsg).
% 1.62/1.84
% 1.62/1.84 ------------> process sos:
% 1.62/1.84 ** KEPT (pick-wt=3): 2 [] A=A.
% 1.62/1.84 ** KEPT (pick-wt=16): 3 [] c_Message_Oanalz(c_union(c_Message_Osynth(A),B,tc_Message_Omsg))=c_union(c_Message_Oanalz(c_union(A,B,tc_Message_Omsg)),c_Message_Osynth(A),tc_Message_Omsg).
% 1.62/1.84 ---> New Demodulator: 4 [new_demod,3] c_Message_Oanalz(c_union(c_Message_Osynth(A),B,tc_Message_Omsg))=c_union(c_Message_Oanalz(c_union(A,B,tc_Message_Omsg)),c_Message_Osynth(A),tc_Message_Omsg).
% 1.62/1.84 ** KEPT (pick-wt=6): 5 [] c_union(A,c_emptyset,B)=A.
% 1.62/1.84 ---> New Demodulator: 6 [new_demod,5] c_union(A,c_emptyset,B)=A.
% 1.62/1.84 Following clause subsumed by 2 during input processing: 0 [copy,2,flip.1] A=A.
% 1.62/1.84 >>>> Starting back demodulation with 4.
% 1.62/1.84 >>>> Starting back demodulation with 6.
% 1.62/1.84
% 1.62/1.84 ======= end of input processing =======
% 1.62/1.84
% 1.62/1.84 =========== start of search ===========
% 1.62/1.84
% 1.62/1.84 -------- PROOF --------
% 1.62/1.84
% 1.62/1.84 ----> UNIT CONFLICT at 0.00 sec ----> 9 [binary,7.1,1.1] $F.
% 1.62/1.84
% 1.62/1.84 Length of proof is 1. Level of proof is 1.
% 1.62/1.84
% 1.62/1.84 ---------------- PROOF ----------------
% 1.62/1.84 % SZS status Unsatisfiable
% 1.62/1.84 % SZS output start Refutation
% See solution above
% 1.62/1.84 ------------ end of proof -------------
% 1.62/1.84
% 1.62/1.84
% 1.62/1.84 Search stopped by max_proofs option.
% 1.62/1.84
% 1.62/1.84
% 1.62/1.84 Search stopped by max_proofs option.
% 1.62/1.84
% 1.62/1.84 ============ end of search ============
% 1.62/1.84
% 1.62/1.84 -------------- statistics -------------
% 1.62/1.84 clauses given 3
% 1.62/1.84 clauses generated 3
% 1.62/1.84 clauses kept 5
% 1.62/1.84 clauses forward subsumed 3
% 1.62/1.84 clauses back subsumed 0
% 1.62/1.84 Kbytes malloced 976
% 1.62/1.84
% 1.62/1.84 ----------- times (seconds) -----------
% 1.62/1.84 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.62/1.84 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.62/1.84 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.62/1.84
% 1.62/1.84 That finishes the proof of the theorem.
% 1.62/1.84
% 1.62/1.84 Process 30581 finished Wed Jul 27 05:45:22 2022
% 1.62/1.84 Otter interrupted
% 1.62/1.84 PROOF FOUND
%------------------------------------------------------------------------------