TSTP Solution File: ROB016-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : ROB016-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n028.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:12:23 EDT 2022
% Result : Unsatisfiable 1.62s 1.81s
% Output : Refutation 1.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 5
% Syntax : Number of clauses : 8 ( 7 unt; 0 nHn; 7 RR)
% Number of literals : 10 ( 7 equ; 3 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 8 ( 3 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 5 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(3,axiom,
( negate(add(negate(A),negate(add(B,negate(A))))) != B
| ~ positive_integer(C)
| negate(add(A,multiply(C,add(B,negate(add(B,negate(A))))))) = negate(A) ),
file('ROB016-1.p',unknown),
[] ).
cnf(4,axiom,
negate(add(e,multiply(k,add(d,negate(add(d,negate(e))))))) != negate(e),
file('ROB016-1.p',unknown),
[] ).
cnf(9,axiom,
negate(add(negate(add(A,B)),negate(add(A,negate(B))))) = A,
file('ROB016-1.p',unknown),
[] ).
cnf(14,axiom,
negate(add(d,e)) = negate(e),
file('ROB016-1.p',unknown),
[] ).
cnf(16,axiom,
positive_integer(k),
file('ROB016-1.p',unknown),
[] ).
cnf(68,plain,
negate(add(negate(e),negate(add(d,negate(e))))) = d,
inference(para_into,[status(thm),theory(equality)],[9,14]),
[iquote('para_into,9.1.1.1.1,14.1.1')] ).
cnf(167,plain,
negate(add(e,multiply(k,add(d,negate(add(d,negate(e))))))) = negate(e),
inference(hyper,[status(thm)],[68,3,16]),
[iquote('hyper,68,3,16')] ).
cnf(169,plain,
$false,
inference(binary,[status(thm)],[167,4]),
[iquote('binary,167.1,4.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : ROB016-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : otter-tptp-script %s
% 0.13/0.33 % Computer : n028.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Wed Jul 27 04:12:18 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.62/1.81 ----- Otter 3.3f, August 2004 -----
% 1.62/1.81 The process was started by sandbox2 on n028.cluster.edu,
% 1.62/1.81 Wed Jul 27 04:12:19 2022
% 1.62/1.81 The command was "./otter". The process ID is 19907.
% 1.62/1.81
% 1.62/1.81 set(prolog_style_variables).
% 1.62/1.81 set(auto).
% 1.62/1.81 dependent: set(auto1).
% 1.62/1.81 dependent: set(process_input).
% 1.62/1.81 dependent: clear(print_kept).
% 1.62/1.81 dependent: clear(print_new_demod).
% 1.62/1.81 dependent: clear(print_back_demod).
% 1.62/1.81 dependent: clear(print_back_sub).
% 1.62/1.81 dependent: set(control_memory).
% 1.62/1.81 dependent: assign(max_mem, 12000).
% 1.62/1.81 dependent: assign(pick_given_ratio, 4).
% 1.62/1.81 dependent: assign(stats_level, 1).
% 1.62/1.81 dependent: assign(max_seconds, 10800).
% 1.62/1.81 clear(print_given).
% 1.62/1.81
% 1.62/1.81 list(usable).
% 1.62/1.81 0 [] A=A.
% 1.62/1.81 0 [] add(X,Y)=add(Y,X).
% 1.62/1.81 0 [] add(add(X,Y),Z)=add(X,add(Y,Z)).
% 1.62/1.81 0 [] negate(add(negate(add(X,Y)),negate(add(X,negate(Y)))))=X.
% 1.62/1.81 0 [] multiply(one,X)=X.
% 1.62/1.81 0 [] -positive_integer(X)|multiply(successor(V),X)=add(X,multiply(V,X)).
% 1.62/1.81 0 [] positive_integer(one).
% 1.62/1.81 0 [] -positive_integer(X)|positive_integer(successor(X)).
% 1.62/1.81 0 [] negate(add(d,e))=negate(e).
% 1.62/1.81 0 [] positive_integer(k).
% 1.62/1.81 0 [] negate(add(negate(Y),negate(add(X,negate(Y)))))!=X| -positive_integer(Vk)|negate(add(Y,multiply(Vk,add(X,negate(add(X,negate(Y)))))))=negate(Y).
% 1.62/1.81 0 [] negate(add(e,multiply(k,add(d,negate(add(d,negate(e)))))))!=negate(e).
% 1.62/1.81 end_of_list.
% 1.62/1.81
% 1.62/1.81 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 1.62/1.81
% 1.62/1.81 This is a Horn set with equality. The strategy will be
% 1.62/1.81 Knuth-Bendix and hyper_res, with positive clauses in
% 1.62/1.81 sos and nonpositive clauses in usable.
% 1.62/1.81
% 1.62/1.81 dependent: set(knuth_bendix).
% 1.62/1.81 dependent: set(anl_eq).
% 1.62/1.81 dependent: set(para_from).
% 1.62/1.81 dependent: set(para_into).
% 1.62/1.81 dependent: clear(para_from_right).
% 1.62/1.81 dependent: clear(para_into_right).
% 1.62/1.81 dependent: set(para_from_vars).
% 1.62/1.81 dependent: set(eq_units_both_ways).
% 1.62/1.81 dependent: set(dynamic_demod_all).
% 1.62/1.81 dependent: set(dynamic_demod).
% 1.62/1.81 dependent: set(order_eq).
% 1.62/1.81 dependent: set(back_demod).
% 1.62/1.81 dependent: set(lrpo).
% 1.62/1.81 dependent: set(hyper_res).
% 1.62/1.81 dependent: clear(order_hyper).
% 1.62/1.81
% 1.62/1.81 ------------> process usable:
% 1.62/1.81 ** KEPT (pick-wt=12): 1 [] -positive_integer(A)|multiply(successor(B),A)=add(A,multiply(B,A)).
% 1.62/1.81 ** KEPT (pick-wt=5): 2 [] -positive_integer(A)|positive_integer(successor(A)).
% 1.62/1.81 ** KEPT (pick-wt=28): 3 [] negate(add(negate(A),negate(add(B,negate(A)))))!=B| -positive_integer(C)|negate(add(A,multiply(C,add(B,negate(add(B,negate(A)))))))=negate(A).
% 1.62/1.81 ** KEPT (pick-wt=15): 4 [] negate(add(e,multiply(k,add(d,negate(add(d,negate(e)))))))!=negate(e).
% 1.62/1.81
% 1.62/1.81 ------------> process sos:
% 1.62/1.81 ** KEPT (pick-wt=3): 5 [] A=A.
% 1.62/1.81 ** KEPT (pick-wt=7): 6 [] add(A,B)=add(B,A).
% 1.62/1.81 ** KEPT (pick-wt=11): 7 [] add(add(A,B),C)=add(A,add(B,C)).
% 1.62/1.81 ---> New Demodulator: 8 [new_demod,7] add(add(A,B),C)=add(A,add(B,C)).
% 1.62/1.81 ** KEPT (pick-wt=13): 9 [] negate(add(negate(add(A,B)),negate(add(A,negate(B)))))=A.
% 1.62/1.81 ---> New Demodulator: 10 [new_demod,9] negate(add(negate(add(A,B)),negate(add(A,negate(B)))))=A.
% 1.62/1.81 ** KEPT (pick-wt=5): 11 [] multiply(one,A)=A.
% 1.62/1.81 ---> New Demodulator: 12 [new_demod,11] multiply(one,A)=A.
% 1.62/1.81 ** KEPT (pick-wt=2): 13 [] positive_integer(one).
% 1.62/1.81 ** KEPT (pick-wt=7): 14 [] negate(add(d,e))=negate(e).
% 1.62/1.81 ---> New Demodulator: 15 [new_demod,14] negate(add(d,e))=negate(e).
% 1.62/1.81 ** KEPT (pick-wt=2): 16 [] positive_integer(k).
% 1.62/1.81 Following clause subsumed by 5 during input processing: 0 [copy,5,flip.1] A=A.
% 1.62/1.81 Following clause subsumed by 6 during input processing: 0 [copy,6,flip.1] add(A,B)=add(B,A).
% 1.62/1.81 >>>> Starting back demodulation with 8.
% 1.62/1.81 >>>> Starting back demodulation with 10.
% 1.62/1.81 >>>> Starting back demodulation with 12.
% 1.62/1.81 >>>> Starting back demodulation with 15.
% 1.62/1.81
% 1.62/1.81 ======= end of input processing =======
% 1.62/1.81
% 1.62/1.81 =========== start of search ===========
% 1.62/1.81
% 1.62/1.81 -------- PROOF --------
% 1.62/1.81
% 1.62/1.81 ----> UNIT CONFLICT at 0.01 sec ----> 169 [binary,167.1,4.1] $F.
% 1.62/1.81
% 1.62/1.81 Length of proof is 2. Level of proof is 2.
% 1.62/1.81
% 1.62/1.81 ---------------- PROOF ----------------
% 1.62/1.81 % SZS status Unsatisfiable
% 1.62/1.81 % SZS output start Refutation
% See solution above
% 1.62/1.81 ------------ end of proof -------------
% 1.62/1.81
% 1.62/1.81
% 1.62/1.81 Search stopped by max_proofs option.
% 1.62/1.81
% 1.62/1.81
% 1.62/1.81 Search stopped by max_proofs option.
% 1.62/1.81
% 1.62/1.81 ============ end of search ============
% 1.62/1.81
% 1.62/1.81 -------------- statistics -------------
% 1.62/1.81 clauses given 33
% 1.62/1.81 clauses generated 177
% 1.62/1.81 clauses kept 114
% 1.62/1.81 clauses forward subsumed 94
% 1.62/1.81 clauses back subsumed 0
% 1.62/1.81 Kbytes malloced 2929
% 1.62/1.81
% 1.62/1.81 ----------- times (seconds) -----------
% 1.62/1.81 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.62/1.81 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.62/1.81 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.62/1.81
% 1.62/1.81 That finishes the proof of the theorem.
% 1.62/1.81
% 1.62/1.81 Process 19907 finished Wed Jul 27 04:12:20 2022
% 1.62/1.81 Otter interrupted
% 1.62/1.81 PROOF FOUND
%------------------------------------------------------------------------------