TSTP Solution File: ROB003-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : ROB003-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n003.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.67s 1.88s
% Output : Refutation 1.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of clauses : 24 ( 24 unt; 0 nHn; 6 RR)
% Number of literals : 24 ( 23 equ; 4 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 : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 24 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
add(negate(add(a,negate(b))),negate(add(negate(a),negate(b)))) != b,
file('ROB003-1.p',unknown),
[] ).
cnf(2,axiom,
A = A,
file('ROB003-1.p',unknown),
[] ).
cnf(3,axiom,
add(A,B) = add(B,A),
file('ROB003-1.p',unknown),
[] ).
cnf(4,axiom,
add(add(A,B),C) = add(A,add(B,C)),
file('ROB003-1.p',unknown),
[] ).
cnf(6,axiom,
negate(add(negate(add(A,B)),negate(add(A,negate(B))))) = A,
file('ROB003-1.p',unknown),
[] ).
cnf(9,axiom,
add(A,c) = c,
file('ROB003-1.p',unknown),
[] ).
cnf(11,plain,
add(c,A) = c,
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[3,9])]),
[iquote('para_into,3.1.1,8.1.1,flip.1')] ).
cnf(13,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(18,plain,
negate(add(negate(c),negate(c))) = c,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[6,11]),11]),
[iquote('para_into,6.1.1.1.1.1,10.1.1,demod,11')] ).
cnf(20,plain,
negate(add(negate(c),negate(add(A,negate(c))))) = A,
inference(para_into,[status(thm),theory(equality)],[6,9]),
[iquote('para_into,6.1.1.1.1.1,8.1.1')] ).
cnf(36,plain,
negate(add(negate(add(A,add(negate(c),negate(c)))),negate(c))) = A,
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[18,6]),9]),
[iquote('para_from,18.1.1,6.1.1.1.2.1.2,demod,9')] ).
cnf(62,plain,
negate(add(negate(c),negate(add(negate(c),A)))) = A,
inference(para_into,[status(thm),theory(equality)],[20,3]),
[iquote('para_into,20.1.1.1.2.1,3.1.1')] ).
cnf(64,plain,
negate(add(negate(add(A,negate(c))),negate(c))) = A,
inference(para_into,[status(thm),theory(equality)],[20,3]),
[iquote('para_into,20.1.1.1,3.1.1')] ).
cnf(88,plain,
negate(add(negate(c),A)) = negate(add(A,negate(c))),
inference(para_into,[status(thm),theory(equality)],[62,20]),
[iquote('para_into,62.1.1.1.2,20.1.1')] ).
cnf(89,plain,
negate(add(negate(add(negate(c),A)),negate(c))) = A,
inference(para_into,[status(thm),theory(equality)],[62,3]),
[iquote('para_into,62.1.1.1,3.1.1')] ).
cnf(91,plain,
negate(add(A,negate(c))) = negate(add(negate(c),A)),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[88])]),
[iquote('copy,88,flip.1')] ).
cnf(98,plain,
add(negate(add(negate(b),a)),negate(add(negate(b),negate(a)))) != b,
inference(para_into,[status(thm),theory(equality)],[13,3]),
[iquote('para_into,13.1.1.1.1,3.1.1')] ).
cnf(100,plain,
negate(add(negate(add(A,add(B,negate(c)))),negate(c))) = add(A,B),
inference(para_into,[status(thm),theory(equality)],[64,4]),
[iquote('para_into,64.1.1.1.1.1,4.1.1')] ).
cnf(102,plain,
add(A,negate(c)) = A,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[36]),100]),
[iquote('back_demod,36,demod,100')] ).
cnf(106,plain,
negate(add(negate(c),A)) = negate(A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[91]),102])]),
[iquote('back_demod,91,demod,102,flip.1')] ).
cnf(108,plain,
negate(negate(A)) = A,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[89]),106,102]),
[iquote('back_demod,89,demod,106,102')] ).
cnf(120,plain,
add(negate(add(A,B)),negate(add(A,negate(B)))) = negate(A),
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[108,6])]),
[iquote('para_into,107.1.1.1,6.1.1,flip.1')] ).
cnf(121,plain,
b != b,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[98]),120,108]),
[iquote('back_demod,98,demod,120,108')] ).
cnf(122,plain,
$false,
inference(binary,[status(thm)],[121,2]),
[iquote('binary,121.1,2.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : ROB003-1 : TPTP v8.1.0. Released v1.0.0.
% 0.10/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n003.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:03:11 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.67/1.88 ----- Otter 3.3f, August 2004 -----
% 1.67/1.88 The process was started by sandbox on n003.cluster.edu,
% 1.67/1.88 Wed Jul 27 04:03:11 2022
% 1.67/1.88 The command was "./otter". The process ID is 30768.
% 1.67/1.88
% 1.67/1.88 set(prolog_style_variables).
% 1.67/1.88 set(auto).
% 1.67/1.88 dependent: set(auto1).
% 1.67/1.88 dependent: set(process_input).
% 1.67/1.88 dependent: clear(print_kept).
% 1.67/1.88 dependent: clear(print_new_demod).
% 1.67/1.88 dependent: clear(print_back_demod).
% 1.67/1.88 dependent: clear(print_back_sub).
% 1.67/1.88 dependent: set(control_memory).
% 1.67/1.88 dependent: assign(max_mem, 12000).
% 1.67/1.88 dependent: assign(pick_given_ratio, 4).
% 1.67/1.88 dependent: assign(stats_level, 1).
% 1.67/1.88 dependent: assign(max_seconds, 10800).
% 1.67/1.88 clear(print_given).
% 1.67/1.88
% 1.67/1.88 list(usable).
% 1.67/1.88 0 [] A=A.
% 1.67/1.88 0 [] add(X,Y)=add(Y,X).
% 1.67/1.88 0 [] add(add(X,Y),Z)=add(X,add(Y,Z)).
% 1.67/1.88 0 [] negate(add(negate(add(X,Y)),negate(add(X,negate(Y)))))=X.
% 1.67/1.88 0 [] add(X,c)=c.
% 1.67/1.88 0 [] add(negate(add(a,negate(b))),negate(add(negate(a),negate(b))))!=b.
% 1.67/1.88 end_of_list.
% 1.67/1.88
% 1.67/1.88 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 1.67/1.88
% 1.67/1.88 All clauses are units, and equality is present; the
% 1.67/1.88 strategy will be Knuth-Bendix with positive clauses in sos.
% 1.67/1.88
% 1.67/1.88 dependent: set(knuth_bendix).
% 1.67/1.88 dependent: set(anl_eq).
% 1.67/1.88 dependent: set(para_from).
% 1.67/1.88 dependent: set(para_into).
% 1.67/1.88 dependent: clear(para_from_right).
% 1.67/1.88 dependent: clear(para_into_right).
% 1.67/1.88 dependent: set(para_from_vars).
% 1.67/1.88 dependent: set(eq_units_both_ways).
% 1.67/1.88 dependent: set(dynamic_demod_all).
% 1.67/1.88 dependent: set(dynamic_demod).
% 1.67/1.88 dependent: set(order_eq).
% 1.67/1.88 dependent: set(back_demod).
% 1.67/1.88 dependent: set(lrpo).
% 1.67/1.88
% 1.67/1.88 ------------> process usable:
% 1.67/1.88 ** KEPT (pick-wt=14): 1 [] add(negate(add(a,negate(b))),negate(add(negate(a),negate(b))))!=b.
% 1.67/1.88
% 1.67/1.88 ------------> process sos:
% 1.67/1.88 ** KEPT (pick-wt=3): 2 [] A=A.
% 1.67/1.88 ** KEPT (pick-wt=7): 3 [] add(A,B)=add(B,A).
% 1.67/1.88 ** KEPT (pick-wt=11): 4 [] add(add(A,B),C)=add(A,add(B,C)).
% 1.67/1.88 ---> New Demodulator: 5 [new_demod,4] add(add(A,B),C)=add(A,add(B,C)).
% 1.67/1.88 ** KEPT (pick-wt=13): 6 [] negate(add(negate(add(A,B)),negate(add(A,negate(B)))))=A.
% 1.67/1.88 ---> New Demodulator: 7 [new_demod,6] negate(add(negate(add(A,B)),negate(add(A,negate(B)))))=A.
% 1.67/1.88 ** KEPT (pick-wt=5): 8 [] add(A,c)=c.
% 1.67/1.88 ---> New Demodulator: 9 [new_demod,8] add(A,c)=c.
% 1.67/1.88 Following clause subsumed by 2 during input processing: 0 [copy,2,flip.1] A=A.
% 1.67/1.88 Following clause subsumed by 3 during input processing: 0 [copy,3,flip.1] add(A,B)=add(B,A).
% 1.67/1.88 >>>> Starting back demodulation with 5.
% 1.67/1.88 >>>> Starting back demodulation with 7.
% 1.67/1.88 >>>> Starting back demodulation with 9.
% 1.67/1.88
% 1.67/1.88 ======= end of input processing =======
% 1.67/1.88
% 1.67/1.88 =========== start of search ===========
% 1.67/1.88
% 1.67/1.88 -------- PROOF --------
% 1.67/1.88
% 1.67/1.88 ----> UNIT CONFLICT at 0.00 sec ----> 122 [binary,121.1,2.1] $F.
% 1.67/1.88
% 1.67/1.88 Length of proof is 17. Level of proof is 8.
% 1.67/1.88
% 1.67/1.88 ---------------- PROOF ----------------
% 1.67/1.88 % SZS status Unsatisfiable
% 1.67/1.88 % SZS output start Refutation
% See solution above
% 1.67/1.88 ------------ end of proof -------------
% 1.67/1.88
% 1.67/1.88
% 1.67/1.88 Search stopped by max_proofs option.
% 1.67/1.88
% 1.67/1.88
% 1.67/1.88 Search stopped by max_proofs option.
% 1.67/1.88
% 1.67/1.88 ============ end of search ============
% 1.67/1.88
% 1.67/1.88 -------------- statistics -------------
% 1.67/1.88 clauses given 18
% 1.67/1.88 clauses generated 213
% 1.67/1.88 clauses kept 81
% 1.67/1.88 clauses forward subsumed 191
% 1.67/1.88 clauses back subsumed 0
% 1.67/1.88 Kbytes malloced 1953
% 1.67/1.88
% 1.67/1.88 ----------- times (seconds) -----------
% 1.67/1.88 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.67/1.88 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.67/1.88 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.67/1.88
% 1.67/1.88 That finishes the proof of the theorem.
% 1.67/1.88
% 1.67/1.88 Process 30768 finished Wed Jul 27 04:03:13 2022
% 1.67/1.88 Otter interrupted
% 1.67/1.88 PROOF FOUND
%------------------------------------------------------------------------------