TSTP Solution File: ROB011-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : ROB011-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n013.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:22 EDT 2022
% Result : Unsatisfiable 1.91s 2.08s
% Output : Refutation 1.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of clauses : 15 ( 15 unt; 0 nHn; 10 RR)
% Number of literals : 15 ( 14 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 11 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(3,axiom,
negate(add(a,negate(add(b,multiply(one,add(a,c)))))) != c,
file('ROB011-1.p',unknown),
[] ).
cnf(5,axiom,
add(A,B) = add(B,A),
file('ROB011-1.p',unknown),
[] ).
cnf(6,axiom,
add(add(A,B),C) = add(A,add(B,C)),
file('ROB011-1.p',unknown),
[] ).
cnf(8,axiom,
negate(add(negate(add(A,B)),negate(add(A,negate(B))))) = A,
file('ROB011-1.p',unknown),
[] ).
cnf(11,axiom,
multiply(one,A) = A,
file('ROB011-1.p',unknown),
[] ).
cnf(13,axiom,
negate(add(a,negate(b))) = c,
file('ROB011-1.p',unknown),
[] ).
cnf(15,plain,
negate(add(a,negate(add(b,add(a,c))))) != c,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[3]),11]),
[iquote('back_demod,3,demod,11')] ).
cnf(37,plain,
add(A,add(B,C)) = add(B,add(C,A)),
inference(para_into,[status(thm),theory(equality)],[6,5]),
[iquote('para_into,6.1.1,5.1.1')] ).
cnf(63,plain,
negate(add(negate(add(a,b)),c)) = a,
inference(para_into,[status(thm),theory(equality)],[8,13]),
[iquote('para_into,8.1.1.1.2,13.1.1')] ).
cnf(69,plain,
negate(add(negate(add(b,a)),c)) = a,
inference(para_into,[status(thm),theory(equality)],[63,5]),
[iquote('para_into,63.1.1.1.1.1,5.1.1')] ).
cnf(77,plain,
negate(add(c,negate(add(b,a)))) = a,
inference(para_into,[status(thm),theory(equality)],[69,5]),
[iquote('para_into,69.1.1.1,5.1.1')] ).
cnf(89,plain,
negate(add(negate(add(c,add(b,a))),a)) = c,
inference(para_from,[status(thm),theory(equality)],[77,8]),
[iquote('para_from,77.1.1,8.1.1.1.2')] ).
cnf(97,plain,
negate(add(negate(add(b,add(a,c))),a)) != c,
inference(para_into,[status(thm),theory(equality)],[15,5]),
[iquote('para_into,15.1.1.1,5.1.1')] ).
cnf(145,plain,
negate(add(negate(add(b,add(a,c))),a)) = c,
inference(para_into,[status(thm),theory(equality)],[89,37]),
[iquote('para_into,89.1.1.1.1.1,37.1.1')] ).
cnf(147,plain,
$false,
inference(binary,[status(thm)],[145,97]),
[iquote('binary,145.1,97.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : ROB011-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n013.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 04:00:45 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.91/2.08 ----- Otter 3.3f, August 2004 -----
% 1.91/2.08 The process was started by sandbox2 on n013.cluster.edu,
% 1.91/2.08 Wed Jul 27 04:00:45 2022
% 1.91/2.08 The command was "./otter". The process ID is 12604.
% 1.91/2.08
% 1.91/2.08 set(prolog_style_variables).
% 1.91/2.08 set(auto).
% 1.91/2.08 dependent: set(auto1).
% 1.91/2.08 dependent: set(process_input).
% 1.91/2.08 dependent: clear(print_kept).
% 1.91/2.08 dependent: clear(print_new_demod).
% 1.91/2.08 dependent: clear(print_back_demod).
% 1.91/2.08 dependent: clear(print_back_sub).
% 1.91/2.08 dependent: set(control_memory).
% 1.91/2.08 dependent: assign(max_mem, 12000).
% 1.91/2.08 dependent: assign(pick_given_ratio, 4).
% 1.91/2.08 dependent: assign(stats_level, 1).
% 1.91/2.08 dependent: assign(max_seconds, 10800).
% 1.91/2.08 clear(print_given).
% 1.91/2.08
% 1.91/2.08 list(usable).
% 1.91/2.08 0 [] A=A.
% 1.91/2.08 0 [] add(X,Y)=add(Y,X).
% 1.91/2.08 0 [] add(add(X,Y),Z)=add(X,add(Y,Z)).
% 1.91/2.08 0 [] negate(add(negate(add(X,Y)),negate(add(X,negate(Y)))))=X.
% 1.91/2.08 0 [] multiply(one,X)=X.
% 1.91/2.08 0 [] -positive_integer(X)|multiply(successor(V),X)=add(X,multiply(V,X)).
% 1.91/2.08 0 [] positive_integer(one).
% 1.91/2.08 0 [] -positive_integer(X)|positive_integer(successor(X)).
% 1.91/2.08 0 [] negate(add(a,negate(b)))=c.
% 1.91/2.08 0 [] negate(add(a,negate(add(b,multiply(one,add(a,c))))))!=c.
% 1.91/2.08 end_of_list.
% 1.91/2.08
% 1.91/2.08 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=2.
% 1.91/2.08
% 1.91/2.08 This is a Horn set with equality. The strategy will be
% 1.91/2.08 Knuth-Bendix and hyper_res, with positive clauses in
% 1.91/2.08 sos and nonpositive clauses in usable.
% 1.91/2.08
% 1.91/2.08 dependent: set(knuth_bendix).
% 1.91/2.08 dependent: set(anl_eq).
% 1.91/2.08 dependent: set(para_from).
% 1.91/2.08 dependent: set(para_into).
% 1.91/2.08 dependent: clear(para_from_right).
% 1.91/2.08 dependent: clear(para_into_right).
% 1.91/2.08 dependent: set(para_from_vars).
% 1.91/2.08 dependent: set(eq_units_both_ways).
% 1.91/2.08 dependent: set(dynamic_demod_all).
% 1.91/2.08 dependent: set(dynamic_demod).
% 1.91/2.08 dependent: set(order_eq).
% 1.91/2.08 dependent: set(back_demod).
% 1.91/2.08 dependent: set(lrpo).
% 1.91/2.08 dependent: set(hyper_res).
% 1.91/2.08 dependent: clear(order_hyper).
% 1.91/2.08
% 1.91/2.08 ------------> process usable:
% 1.91/2.08 ** KEPT (pick-wt=12): 1 [] -positive_integer(A)|multiply(successor(B),A)=add(A,multiply(B,A)).
% 1.91/2.08 ** KEPT (pick-wt=5): 2 [] -positive_integer(A)|positive_integer(successor(A)).
% 1.91/2.08 ** KEPT (pick-wt=13): 3 [] negate(add(a,negate(add(b,multiply(one,add(a,c))))))!=c.
% 1.91/2.08
% 1.91/2.08 ------------> process sos:
% 1.91/2.08 ** KEPT (pick-wt=3): 4 [] A=A.
% 1.91/2.08 ** KEPT (pick-wt=7): 5 [] add(A,B)=add(B,A).
% 1.91/2.08 ** KEPT (pick-wt=11): 6 [] add(add(A,B),C)=add(A,add(B,C)).
% 1.91/2.08 ---> New Demodulator: 7 [new_demod,6] add(add(A,B),C)=add(A,add(B,C)).
% 1.91/2.08 ** KEPT (pick-wt=13): 8 [] negate(add(negate(add(A,B)),negate(add(A,negate(B)))))=A.
% 1.91/2.08 ---> New Demodulator: 9 [new_demod,8] negate(add(negate(add(A,B)),negate(add(A,negate(B)))))=A.
% 1.91/2.08 ** KEPT (pick-wt=5): 10 [] multiply(one,A)=A.
% 1.91/2.08 ---> New Demodulator: 11 [new_demod,10] multiply(one,A)=A.
% 1.91/2.08 ** KEPT (pick-wt=2): 12 [] positive_integer(one).
% 1.91/2.08 ** KEPT (pick-wt=7): 13 [] negate(add(a,negate(b)))=c.
% 1.91/2.08 ---> New Demodulator: 14 [new_demod,13] negate(add(a,negate(b)))=c.
% 1.91/2.08 Following clause subsumed by 4 during input processing: 0 [copy,4,flip.1] A=A.
% 1.91/2.08 Following clause subsumed by 5 during input processing: 0 [copy,5,flip.1] add(A,B)=add(B,A).
% 1.91/2.08 >>>> Starting back demodulation with 7.
% 1.91/2.08 >>>> Starting back demodulation with 9.
% 1.91/2.08 >>>> Starting back demodulation with 11.
% 1.91/2.08 >> back demodulating 3 with 11.
% 1.91/2.08 >>>> Starting back demodulation with 14.
% 1.91/2.08
% 1.91/2.08 ======= end of input processing =======
% 1.91/2.08
% 1.91/2.08 =========== start of search ===========
% 1.91/2.08
% 1.91/2.08 -------- PROOF --------
% 1.91/2.08
% 1.91/2.08 ----> UNIT CONFLICT at 0.00 sec ----> 147 [binary,145.1,97.1] $F.
% 1.91/2.08
% 1.91/2.08 Length of proof is 8. Level of proof is 5.
% 1.91/2.08
% 1.91/2.08 ---------------- PROOF ----------------
% 1.91/2.08 % SZS status Unsatisfiable
% 1.91/2.08 % SZS output start Refutation
% See solution above
% 1.91/2.08 ------------ end of proof -------------
% 1.91/2.08
% 1.91/2.08
% 1.91/2.08 Search stopped by max_proofs option.
% 1.91/2.08
% 1.91/2.08
% 1.91/2.08 Search stopped by max_proofs option.
% 1.91/2.08
% 1.91/2.08 ============ end of search ============
% 1.91/2.08
% 1.91/2.08 -------------- statistics -------------
% 1.91/2.08 clauses given 29
% 1.91/2.08 clauses generated 161
% 1.91/2.08 clauses kept 92
% 1.91/2.08 clauses forward subsumed 99
% 1.91/2.08 clauses back subsumed 0
% 1.91/2.08 Kbytes malloced 1953
% 1.91/2.08
% 1.91/2.08 ----------- times (seconds) -----------
% 1.91/2.08 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.91/2.08 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.91/2.08 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.91/2.08
% 1.91/2.08 That finishes the proof of the theorem.
% 1.91/2.08
% 1.91/2.08 Process 12604 finished Wed Jul 27 04:00:47 2022
% 1.91/2.08 Otter interrupted
% 1.91/2.08 PROOF FOUND
%------------------------------------------------------------------------------