TSTP Solution File: SWV819-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SWV819-1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n024.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:21:37 EDT 2022
% Result : Unsatisfiable 1.33s 1.85s
% Output : Refutation 1.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 2
% Syntax : Number of clauses : 4 ( 4 unt; 0 nHn; 2 RR)
% Number of literals : 4 ( 3 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 2 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(3,axiom,
v_ta != v_t,
file('SWV819-1.p',unknown),
[] ).
cnf(7,axiom,
A = v_ta,
file('SWV819-1.p',unknown),
[] ).
cnf(8,plain,
v_ta = A,
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[7])]),
[iquote('copy,7,flip.1')] ).
cnf(9,plain,
$false,
inference(binary,[status(thm)],[8,3]),
[iquote('binary,8.1,3.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV819-1 : TPTP v8.1.0. Released v4.1.0.
% 0.07/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n024.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:14:25 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.33/1.85
% 1.33/1.85 -------- PROOF --------
% 1.33/1.85 ----- Otter 3.3f, August 2004 -----
% 1.33/1.85 The process was started by sandbox on n024.cluster.edu,
% 1.33/1.85 Wed Jul 27 06:14:25 2022
% 1.33/1.85 The command was "./otter". The process ID is 8564.
% 1.33/1.85
% 1.33/1.85 set(prolog_style_variables).
% 1.33/1.85 set(auto).
% 1.33/1.85 dependent: set(auto1).
% 1.33/1.85 dependent: set(process_input).
% 1.33/1.85 dependent: clear(print_kept).
% 1.33/1.85 dependent: clear(print_new_demod).
% 1.33/1.85 dependent: clear(print_back_demod).
% 1.33/1.85 dependent: clear(print_back_sub).
% 1.33/1.85 dependent: set(control_memory).
% 1.33/1.85 dependent: assign(max_mem, 12000).
% 1.33/1.85 dependent: assign(pick_given_ratio, 4).
% 1.33/1.85 dependent: assign(stats_level, 1).
% 1.33/1.85 dependent: assign(max_seconds, 10800).
% 1.33/1.85 clear(print_given).
% 1.33/1.85
% 1.33/1.85 list(usable).
% 1.33/1.85 0 [] A=A.
% 1.33/1.85 0 [] c_Code__Evaluation_Otracing(V_s,V_x,T_a)=V_x.
% 1.33/1.85 0 [] c_Code__Evaluation_Otracing(v_s,v_x,t_a)=v_x.
% 1.33/1.85 0 [] v_s!=v_t.
% 1.33/1.85 0 [] V_s=v_ta.
% 1.33/1.85 0 [] v_ta!=v_t.
% 1.33/1.85 end_of_list.
% 1.33/1.85
% 1.33/1.85 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 1.33/1.85
% 1.33/1.85 All clauses are units, and equality is present; the
% 1.33/1.85 strategy will be Knuth-Bendix with positive clauses in sos.
% 1.33/1.85
% 1.33/1.85 dependent: set(knuth_bendix).
% 1.33/1.85 dependent: set(anl_eq).
% 1.33/1.85 dependent: set(para_from).
% 1.33/1.85 dependent: set(para_into).
% 1.33/1.85 dependent: clear(para_from_right).
% 1.33/1.85 dependent: clear(para_into_right).
% 1.33/1.85 dependent: set(para_from_vars).
% 1.33/1.85 dependent: set(eq_units_both_ways).
% 1.33/1.85 dependent: set(dynamic_demod_all).
% 1.33/1.85 dependent: set(dynamic_demod).
% 1.33/1.85 dependent: set(order_eq).
% 1.33/1.85 dependent: set(back_demod).
% 1.33/1.85 dependent: set(lrpo).
% 1.33/1.85
% 1.33/1.85 ------------> process usable:
% 1.33/1.85 ** KEPT (pick-wt=3): 2 [copy,1,flip.1] v_t!=v_s.
% 1.33/1.85 ** KEPT (pick-wt=3): 3 [] v_ta!=v_t.
% 1.33/1.85
% 1.33/1.85 ------------> process sos:
% 1.33/1.85 ** KEPT (pick-wt=3): 4 [] A=A.
% 1.33/1.85 ** KEPT (pick-wt=6): 5 [] c_Code__Evaluation_Otracing(A,B,C)=B.
% 1.33/1.85 ---> New Demodulator: 6 [new_demod,5] c_Code__Evaluation_Otracing(A,B,C)=B.
% 1.33/1.85 Following clause subsumed by 4 during input processing: 0 [demod,6] v_x=v_x.
% 1.33/1.85 ** KEPT (pick-wt=3): 7 [] A=v_ta.
% 1.33/1.85 Following clause subsumed by 4 during input processing: 0 [copy,4,flip.1] A=A.
% 1.33/1.85 >>>> Starting back demodulation with 6.
% 1.33/1.85 ** KEPT (pick-wt=3): 8 [copy,7,flip.1] v_ta=A.
% 1.33/1.85
% 1.33/1.85 ----> UNIT CONFLICT at 0.00 sec ----> 9 [binary,8.1,3.1] $F.
% 1.33/1.85
% 1.33/1.85 Length of proof is 1. Level of proof is 1.
% 1.33/1.85
% 1.33/1.85 ---------------- PROOF ----------------
% 1.33/1.85 % SZS status Unsatisfiable
% 1.33/1.85 % SZS output start Refutation
% See solution above
% 1.33/1.85 ------------ end of proof -------------
% 1.33/1.85
% 1.33/1.85
% 1.33/1.85 Search stopped by max_proofs option.
% 1.33/1.85
% 1.33/1.85
% 1.33/1.85 Search stopped by max_proofs option.
% 1.33/1.85
% 1.33/1.85 ============ end of search ============
% 1.33/1.85
% 1.33/1.85 -------------- statistics -------------
% 1.33/1.85 clauses given 0
% 1.33/1.85 clauses generated 0
% 1.33/1.85 clauses kept 6
% 1.33/1.85 clauses forward subsumed 2
% 1.33/1.85 clauses back subsumed 0
% 1.33/1.85 Kbytes malloced 976
% 1.33/1.85
% 1.33/1.85 ----------- times (seconds) -----------
% 1.33/1.85 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.33/1.85 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.33/1.85 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.33/1.85
% 1.33/1.85 That finishes the proof of the theorem.
% 1.33/1.85
% 1.33/1.85 Process 8564 finished Wed Jul 27 06:14:26 2022
% 1.33/1.85 Otter interrupted
% 1.33/1.85 PROOF FOUND
%------------------------------------------------------------------------------