TSTP Solution File: ROB004-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : ROB004-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n020.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:21 EDT 2022
% Result : Unsatisfiable 1.92s 2.15s
% Output : Refutation 1.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 8
% Syntax : Number of clauses : 31 ( 31 unt; 0 nHn; 8 RR)
% Number of literals : 31 ( 30 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 : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 29 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
add(negate(add(a,negate(b))),negate(add(negate(a),negate(b)))) != b,
file('ROB004-1.p',unknown),
[] ).
cnf(2,axiom,
A = A,
file('ROB004-1.p',unknown),
[] ).
cnf(3,axiom,
add(A,B) = add(B,A),
file('ROB004-1.p',unknown),
[] ).
cnf(5,axiom,
add(add(A,B),C) = add(A,add(B,C)),
file('ROB004-1.p',unknown),
[] ).
cnf(7,axiom,
negate(add(negate(add(A,B)),negate(add(A,negate(B))))) = A,
file('ROB004-1.p',unknown),
[] ).
cnf(8,axiom,
negate(d) = c,
file('ROB004-1.p',unknown),
[] ).
cnf(10,axiom,
add(c,d) = d,
file('ROB004-1.p',unknown),
[] ).
cnf(13,axiom,
add(c,c) = c,
file('ROB004-1.p',unknown),
[] ).
cnf(14,plain,
add(d,c) = d,
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[3,10])]),
[iquote('para_into,3.1.1,10.1.1,flip.1')] ).
cnf(17,plain,
add(negate(add(a,negate(b))),negate(add(negate(b),negate(a)))) != b,
inference(para_from,[status(thm),theory(equality)],[3,1]),
[iquote('para_from,3.1.1,1.1.1.2.1')] ).
cnf(19,plain,
add(c,add(c,A)) = add(c,A),
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[5,13])]),
[iquote('para_into,4.1.1.1,12.1.1,flip.1')] ).
cnf(21,plain,
add(c,add(d,A)) = add(d,A),
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[5,10])]),
[iquote('para_into,4.1.1.1,10.1.1,flip.1')] ).
cnf(26,plain,
add(d,add(c,A)) = add(d,A),
inference(flip,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[14,5])]),
[iquote('para_from,14.1.1,4.1.1.1,flip.1')] ).
cnf(28,plain,
add(c,add(A,c)) = add(c,A),
inference(para_into,[status(thm),theory(equality)],[19,3]),
[iquote('para_into,19.1.1.2,3.1.1')] ).
cnf(31,plain,
add(d,add(A,c)) = add(d,A),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[21,3]),5]),
[iquote('para_into,21.1.1,3.1.1,demod,5')] ).
cnf(48,plain,
negate(add(negate(add(A,B)),negate(add(B,negate(A))))) = B,
inference(para_into,[status(thm),theory(equality)],[7,3]),
[iquote('para_into,6.1.1.1.1.1,3.1.1')] ).
cnf(52,plain,
negate(add(negate(add(A,d)),negate(add(A,c)))) = A,
inference(para_into,[status(thm),theory(equality)],[7,8]),
[iquote('para_into,6.1.1.1.2.1.2,8.1.1')] ).
cnf(74,plain,
negate(add(negate(add(c,A)),negate(add(c,negate(add(A,c)))))) = c,
inference(para_from,[status(thm),theory(equality)],[28,7]),
[iquote('para_from,28.1.1,6.1.1.1.1.1')] ).
cnf(206,plain,
negate(add(negate(add(d,A)),negate(add(A,c)))) = A,
inference(para_into,[status(thm),theory(equality)],[52,3]),
[iquote('para_into,52.1.1.1.1.1,3.1.1')] ).
cnf(262,plain,
add(A,c) = A,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[206,31]),5,13,206])]),
[iquote('para_into,205.1.1.1.1.1,31.1.1,demod,5,13,206,flip.1')] ).
cnf(264,plain,
negate(add(negate(add(d,A)),negate(add(c,A)))) = add(c,A),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[206,26]),262]),
[iquote('para_into,205.1.1.1.1.1,26.1.1,demod,262')] ).
cnf(276,plain,
add(c,A) = A,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[206,3]),264]),
[iquote('para_into,205.1.1.1.2.1,3.1.1,demod,264')] ).
cnf(309,plain,
negate(add(negate(A),negate(negate(A)))) = c,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[74]),276,262,276]),
[iquote('back_demod,74,demod,276,262,276')] ).
cnf(337,plain,
negate(add(A,negate(A))) = c,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[309,7]),7]),
[iquote('para_into,309.1.1.1.1,6.1.1,demod,7')] ).
cnf(391,plain,
negate(add(negate(A),A)) = c,
inference(para_into,[status(thm),theory(equality)],[337,3]),
[iquote('para_into,337.1.1.1,3.1.1')] ).
cnf(399,plain,
negate(negate(add(A,negate(negate(A))))) = A,
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[337,7]),276]),
[iquote('para_from,337.1.1,6.1.1.1.1,demod,276')] ).
cnf(420,plain,
negate(negate(add(negate(negate(A)),A))) = negate(negate(A)),
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[391,7]),262]),
[iquote('para_from,391.1.1,6.1.1.1.2,demod,262')] ).
cnf(458,plain,
negate(negate(A)) = A,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[399,3]),420]),
[iquote('para_into,399.1.1.1.1,3.1.1,demod,420')] ).
cnf(556,plain,
add(negate(add(A,B)),negate(add(B,negate(A)))) = negate(B),
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[458,48])]),
[iquote('para_into,457.1.1.1,48.1.1,flip.1')] ).
cnf(565,plain,
b != b,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[17]),556,458]),
[iquote('back_demod,17,demod,556,458')] ).
cnf(566,plain,
$false,
inference(binary,[status(thm)],[565,2]),
[iquote('binary,565.1,2.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : ROB004-1 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.12 % Command : otter-tptp-script %s
% 0.13/0.33 % Computer : n020.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:06:23 EDT 2022
% 0.13/0.33 % CPUTime :
% 1.92/2.15 ----- Otter 3.3f, August 2004 -----
% 1.92/2.15 The process was started by sandbox on n020.cluster.edu,
% 1.92/2.15 Wed Jul 27 04:06:23 2022
% 1.92/2.15 The command was "./otter". The process ID is 1920.
% 1.92/2.15
% 1.92/2.15 set(prolog_style_variables).
% 1.92/2.15 set(auto).
% 1.92/2.15 dependent: set(auto1).
% 1.92/2.15 dependent: set(process_input).
% 1.92/2.15 dependent: clear(print_kept).
% 1.92/2.15 dependent: clear(print_new_demod).
% 1.92/2.15 dependent: clear(print_back_demod).
% 1.92/2.15 dependent: clear(print_back_sub).
% 1.92/2.15 dependent: set(control_memory).
% 1.92/2.15 dependent: assign(max_mem, 12000).
% 1.92/2.15 dependent: assign(pick_given_ratio, 4).
% 1.92/2.15 dependent: assign(stats_level, 1).
% 1.92/2.15 dependent: assign(max_seconds, 10800).
% 1.92/2.15 clear(print_given).
% 1.92/2.15
% 1.92/2.15 list(usable).
% 1.92/2.15 0 [] A=A.
% 1.92/2.15 0 [] add(X,Y)=add(Y,X).
% 1.92/2.15 0 [] add(add(X,Y),Z)=add(X,add(Y,Z)).
% 1.92/2.15 0 [] negate(add(negate(add(X,Y)),negate(add(X,negate(Y)))))=X.
% 1.92/2.15 0 [] negate(d)=c.
% 1.92/2.15 0 [] add(c,d)=d.
% 1.92/2.15 0 [] add(c,c)=c.
% 1.92/2.15 0 [] add(negate(add(a,negate(b))),negate(add(negate(a),negate(b))))!=b.
% 1.92/2.15 end_of_list.
% 1.92/2.15
% 1.92/2.15 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 1.92/2.15
% 1.92/2.15 All clauses are units, and equality is present; the
% 1.92/2.15 strategy will be Knuth-Bendix with positive clauses in sos.
% 1.92/2.15
% 1.92/2.15 dependent: set(knuth_bendix).
% 1.92/2.15 dependent: set(anl_eq).
% 1.92/2.15 dependent: set(para_from).
% 1.92/2.15 dependent: set(para_into).
% 1.92/2.15 dependent: clear(para_from_right).
% 1.92/2.15 dependent: clear(para_into_right).
% 1.92/2.15 dependent: set(para_from_vars).
% 1.92/2.15 dependent: set(eq_units_both_ways).
% 1.92/2.15 dependent: set(dynamic_demod_all).
% 1.92/2.15 dependent: set(dynamic_demod).
% 1.92/2.15 dependent: set(order_eq).
% 1.92/2.15 dependent: set(back_demod).
% 1.92/2.15 dependent: set(lrpo).
% 1.92/2.15
% 1.92/2.15 ------------> process usable:
% 1.92/2.15 ** KEPT (pick-wt=14): 1 [] add(negate(add(a,negate(b))),negate(add(negate(a),negate(b))))!=b.
% 1.92/2.15
% 1.92/2.15 ------------> process sos:
% 1.92/2.15 ** KEPT (pick-wt=3): 2 [] A=A.
% 1.92/2.15 ** KEPT (pick-wt=7): 3 [] add(A,B)=add(B,A).
% 1.92/2.15 ** KEPT (pick-wt=11): 4 [] add(add(A,B),C)=add(A,add(B,C)).
% 1.92/2.15 ---> New Demodulator: 5 [new_demod,4] add(add(A,B),C)=add(A,add(B,C)).
% 1.92/2.15 ** KEPT (pick-wt=13): 6 [] negate(add(negate(add(A,B)),negate(add(A,negate(B)))))=A.
% 1.92/2.15 ---> New Demodulator: 7 [new_demod,6] negate(add(negate(add(A,B)),negate(add(A,negate(B)))))=A.
% 1.92/2.15 ** KEPT (pick-wt=4): 8 [] negate(d)=c.
% 1.92/2.15 ---> New Demodulator: 9 [new_demod,8] negate(d)=c.
% 1.92/2.15 ** KEPT (pick-wt=5): 10 [] add(c,d)=d.
% 1.92/2.15 ---> New Demodulator: 11 [new_demod,10] add(c,d)=d.
% 1.92/2.15 ** KEPT (pick-wt=5): 12 [] add(c,c)=c.
% 1.92/2.15 ---> New Demodulator: 13 [new_demod,12] add(c,c)=c.
% 1.92/2.15 Following clause subsumed by 2 during input processing: 0 [copy,2,flip.1] A=A.
% 1.92/2.15 Following clause subsumed by 3 during input processing: 0 [copy,3,flip.1] add(A,B)=add(B,A).
% 1.92/2.15 >>>> Starting back demodulation with 5.
% 1.92/2.15 >>>> Starting back demodulation with 7.
% 1.92/2.15 >>>> Starting back demodulation with 9.
% 1.92/2.15 >>>> Starting back demodulation with 11.
% 1.92/2.15 >>>> Starting back demodulation with 13.
% 1.92/2.15
% 1.92/2.15 ======= end of input processing =======
% 1.92/2.15
% 1.92/2.15 =========== start of search ===========
% 1.92/2.15
% 1.92/2.15 -------- PROOF --------
% 1.92/2.15
% 1.92/2.15 ----> UNIT CONFLICT at 0.02 sec ----> 566 [binary,565.1,2.1] $F.
% 1.92/2.15
% 1.92/2.15 Length of proof is 22. Level of proof is 12.
% 1.92/2.15
% 1.92/2.15 ---------------- PROOF ----------------
% 1.92/2.15 % SZS status Unsatisfiable
% 1.92/2.15 % SZS output start Refutation
% See solution above
% 1.92/2.15 ------------ end of proof -------------
% 1.92/2.15
% 1.92/2.15
% 1.92/2.15 Search stopped by max_proofs option.
% 1.92/2.15
% 1.92/2.15
% 1.92/2.15 Search stopped by max_proofs option.
% 1.92/2.15
% 1.92/2.15 ============ end of search ============
% 1.92/2.15
% 1.92/2.15 -------------- statistics -------------
% 1.92/2.15 clauses given 47
% 1.92/2.15 clauses generated 729
% 1.92/2.15 clauses kept 304
% 1.92/2.15 clauses forward subsumed 638
% 1.92/2.15 clauses back subsumed 0
% 1.92/2.15 Kbytes malloced 2929
% 1.92/2.15
% 1.92/2.15 ----------- times (seconds) -----------
% 1.92/2.15 user CPU time 0.02 (0 hr, 0 min, 0 sec)
% 1.92/2.15 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.92/2.15 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.92/2.15
% 1.92/2.15 That finishes the proof of the theorem.
% 1.92/2.15
% 1.92/2.15 Process 1920 finished Wed Jul 27 04:06:25 2022
% 1.92/2.15 Otter interrupted
% 1.92/2.15 PROOF FOUND
%------------------------------------------------------------------------------