TSTP Solution File: ROB023-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : ROB023-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.73s 1.96s
% Output : Refutation 1.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 6
% Syntax : Number of clauses : 31 ( 31 unt; 0 nHn; 4 RR)
% Number of literals : 31 ( 30 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 40 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
add(negate(add(a,negate(b))),negate(add(negate(a),negate(b)))) != b,
file('ROB023-1.p',unknown),
[] ).
cnf(2,axiom,
A = A,
file('ROB023-1.p',unknown),
[] ).
cnf(3,axiom,
add(A,B) = add(B,A),
file('ROB023-1.p',unknown),
[] ).
cnf(5,axiom,
add(add(A,B),C) = add(A,add(B,C)),
file('ROB023-1.p',unknown),
[] ).
cnf(6,axiom,
negate(add(negate(add(A,B)),negate(add(A,negate(B))))) = A,
file('ROB023-1.p',unknown),
[] ).
cnf(8,axiom,
add(A,A) = A,
file('ROB023-1.p',unknown),
[] ).
cnf(12,plain,
add(negate(add(negate(b),a)),negate(add(negate(a),negate(b)))) != b,
inference(para_from,[status(thm),theory(equality)],[3,1]),
[iquote('para_from,3.1.1,1.1.1.1.1')] ).
cnf(13,plain,
add(A,add(A,B)) = add(A,B),
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[5,8])]),
[iquote('para_into,4.1.1.1,8.1.1,flip.1')] ).
cnf(15,plain,
add(A,add(B,C)) = add(B,add(A,C)),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[5,3]),5]),
[iquote('para_into,4.1.1.1,3.1.1,demod,5')] ).
cnf(23,plain,
add(A,add(B,A)) = add(A,B),
inference(para_into,[status(thm),theory(equality)],[13,3]),
[iquote('para_into,13.1.1.2,3.1.1')] ).
cnf(26,plain,
negate(add(negate(A),negate(add(A,negate(A))))) = A,
inference(para_into,[status(thm),theory(equality)],[6,8]),
[iquote('para_into,6.1.1.1.1.1,8.1.1')] ).
cnf(36,plain,
negate(add(negate(add(negate(A),A)),negate(negate(A)))) = negate(A),
inference(para_into,[status(thm),theory(equality)],[6,8]),
[iquote('para_into,6.1.1.1.2.1,8.1.1')] ).
cnf(38,plain,
negate(add(negate(add(A,B)),negate(add(negate(B),A)))) = A,
inference(para_into,[status(thm),theory(equality)],[6,3]),
[iquote('para_into,6.1.1.1.2.1,3.1.1')] ).
cnf(52,plain,
add(A,add(B,C)) = add(A,add(C,B)),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[15,3]),5]),
[iquote('para_into,15.1.1,3.1.1,demod,5')] ).
cnf(81,plain,
negate(add(negate(add(A,negate(A))),negate(A))) = A,
inference(para_into,[status(thm),theory(equality)],[26,3]),
[iquote('para_into,26.1.1.1,3.1.1')] ).
cnf(82,plain,
negate(add(negate(add(negate(A),A)),A)) = negate(A),
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[26,6]),23]),
[iquote('para_from,26.1.1,6.1.1.1.2,demod,23')] ).
cnf(125,plain,
negate(add(negate(add(negate(add(A,negate(A))),add(negate(A),A))),A)) = add(negate(add(A,negate(A))),negate(A)),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[81,81]),5,81]),
[iquote('para_into,80.1.1.1.1.1.2,80.1.1,demod,5,81')] ).
cnf(139,plain,
negate(add(negate(add(negate(add(A,negate(A))),A)),A)) = negate(add(A,negate(A))),
inference(para_from,[status(thm),theory(equality)],[81,6]),
[iquote('para_from,80.1.1,6.1.1.1.2')] ).
cnf(166,plain,
negate(add(negate(add(A,negate(A))),A)) = negate(A),
inference(para_into,[status(thm),theory(equality)],[82,3]),
[iquote('para_into,82.1.1.1.1.1,3.1.1')] ).
cnf(180,plain,
negate(add(negate(A),A)) = negate(add(A,negate(A))),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[139]),166]),
[iquote('back_demod,139,demod,166')] ).
cnf(195,plain,
negate(add(negate(add(A,negate(A))),negate(negate(A)))) = negate(A),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[36]),180]),
[iquote('back_demod,36,demod,180')] ).
cnf(197,plain,
negate(add(negate(add(A,add(negate(A),negate(add(A,negate(A)))))),add(negate(add(A,negate(A))),A))) = negate(A),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[166,166]),5,180,5,166]),
[iquote('para_into,165.1.1.1.1.1.2,165.1.1,demod,5,180,5,166')] ).
cnf(206,plain,
negate(add(negate(add(A,add(negate(A),negate(add(A,negate(A)))))),negate(A))) = add(negate(add(A,negate(A))),A),
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[166,81]),166,5,180,5]),
[iquote('para_from,165.1.1,80.1.1.1.2,demod,166,5,180,5')] ).
cnf(223,plain,
negate(add(negate(add(A,B)),add(B,A))) = negate(add(A,add(B,negate(add(A,B))))),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[180,52]),5]),
[iquote('para_into,179.1.1.1,52.1.1,demod,5')] ).
cnf(231,plain,
negate(add(negate(add(A,add(negate(A),negate(add(A,negate(A)))))),A)) = add(negate(add(A,negate(A))),negate(A)),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[125]),223]),
[iquote('back_demod,125,demod,223')] ).
cnf(564,plain,
add(negate(add(A,negate(A))),A) = A,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[195,81]),5,223,81,206,81]),
[iquote('para_into,195.1.1.1.1.1.2,80.1.1,demod,5,223,81,206,81')] ).
cnf(582,plain,
add(negate(add(A,negate(A))),negate(A)) = negate(A),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[197]),564,231]),
[iquote('back_demod,197,demod,564,231')] ).
cnf(586,plain,
negate(negate(A)) = A,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[81]),582]),
[iquote('back_demod,80,demod,582')] ).
cnf(608,plain,
add(negate(add(A,B)),negate(add(negate(B),A))) = negate(A),
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[586,38])]),
[iquote('para_into,585.1.1.1,38.1.1,flip.1')] ).
cnf(625,plain,
b != b,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[12]),608,586]),
[iquote('back_demod,12,demod,608,586')] ).
cnf(626,plain,
$false,
inference(binary,[status(thm)],[625,2]),
[iquote('binary,625.1,2.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : ROB023-1 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.13 % Command : otter-tptp-script %s
% 0.12/0.34 % Computer : n028.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Wed Jul 27 04:12:33 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.73/1.96 ----- Otter 3.3f, August 2004 -----
% 1.73/1.96 The process was started by sandbox on n028.cluster.edu,
% 1.73/1.96 Wed Jul 27 04:12:33 2022
% 1.73/1.96 The command was "./otter". The process ID is 21434.
% 1.73/1.96
% 1.73/1.96 set(prolog_style_variables).
% 1.73/1.96 set(auto).
% 1.73/1.96 dependent: set(auto1).
% 1.73/1.96 dependent: set(process_input).
% 1.73/1.96 dependent: clear(print_kept).
% 1.73/1.96 dependent: clear(print_new_demod).
% 1.73/1.96 dependent: clear(print_back_demod).
% 1.73/1.96 dependent: clear(print_back_sub).
% 1.73/1.96 dependent: set(control_memory).
% 1.73/1.96 dependent: assign(max_mem, 12000).
% 1.73/1.96 dependent: assign(pick_given_ratio, 4).
% 1.73/1.96 dependent: assign(stats_level, 1).
% 1.73/1.96 dependent: assign(max_seconds, 10800).
% 1.73/1.96 clear(print_given).
% 1.73/1.96
% 1.73/1.96 list(usable).
% 1.73/1.96 0 [] A=A.
% 1.73/1.96 0 [] add(X,Y)=add(Y,X).
% 1.73/1.96 0 [] add(add(X,Y),Z)=add(X,add(Y,Z)).
% 1.73/1.96 0 [] negate(add(negate(add(X,Y)),negate(add(X,negate(Y)))))=X.
% 1.73/1.96 0 [] add(X,X)=X.
% 1.73/1.96 0 [] add(negate(add(a,negate(b))),negate(add(negate(a),negate(b))))!=b.
% 1.73/1.96 end_of_list.
% 1.73/1.96
% 1.73/1.96 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 1.73/1.96
% 1.73/1.96 All clauses are units, and equality is present; the
% 1.73/1.96 strategy will be Knuth-Bendix with positive clauses in sos.
% 1.73/1.96
% 1.73/1.96 dependent: set(knuth_bendix).
% 1.73/1.96 dependent: set(anl_eq).
% 1.73/1.96 dependent: set(para_from).
% 1.73/1.96 dependent: set(para_into).
% 1.73/1.96 dependent: clear(para_from_right).
% 1.73/1.96 dependent: clear(para_into_right).
% 1.73/1.96 dependent: set(para_from_vars).
% 1.73/1.96 dependent: set(eq_units_both_ways).
% 1.73/1.96 dependent: set(dynamic_demod_all).
% 1.73/1.96 dependent: set(dynamic_demod).
% 1.73/1.96 dependent: set(order_eq).
% 1.73/1.96 dependent: set(back_demod).
% 1.73/1.96 dependent: set(lrpo).
% 1.73/1.96
% 1.73/1.96 ------------> process usable:
% 1.73/1.96 ** KEPT (pick-wt=14): 1 [] add(negate(add(a,negate(b))),negate(add(negate(a),negate(b))))!=b.
% 1.73/1.96
% 1.73/1.96 ------------> process sos:
% 1.73/1.96 ** KEPT (pick-wt=3): 2 [] A=A.
% 1.73/1.96 ** KEPT (pick-wt=7): 3 [] add(A,B)=add(B,A).
% 1.73/1.96 ** KEPT (pick-wt=11): 4 [] add(add(A,B),C)=add(A,add(B,C)).
% 1.73/1.96 ---> New Demodulator: 5 [new_demod,4] add(add(A,B),C)=add(A,add(B,C)).
% 1.73/1.96 ** KEPT (pick-wt=13): 6 [] negate(add(negate(add(A,B)),negate(add(A,negate(B)))))=A.
% 1.73/1.96 ---> New Demodulator: 7 [new_demod,6] negate(add(negate(add(A,B)),negate(add(A,negate(B)))))=A.
% 1.73/1.96 ** KEPT (pick-wt=5): 8 [] add(A,A)=A.
% 1.73/1.96 ---> New Demodulator: 9 [new_demod,8] add(A,A)=A.
% 1.73/1.96 Following clause subsumed by 2 during input processing: 0 [copy,2,flip.1] A=A.
% 1.73/1.96 Following clause subsumed by 3 during input processing: 0 [copy,3,flip.1] add(A,B)=add(B,A).
% 1.73/1.96 >>>> Starting back demodulation with 5.
% 1.73/1.96 >>>> Starting back demodulation with 7.
% 1.73/1.96 >>>> Starting back demodulation with 9.
% 1.73/1.96
% 1.73/1.96 ======= end of input processing =======
% 1.73/1.96
% 1.73/1.96 =========== start of search ===========
% 1.73/1.96
% 1.73/1.96 -------- PROOF --------
% 1.73/1.96
% 1.73/1.96 ----> UNIT CONFLICT at 0.02 sec ----> 626 [binary,625.1,2.1] $F.
% 1.73/1.96
% 1.73/1.96 Length of proof is 24. Level of proof is 11.
% 1.73/1.96
% 1.73/1.96 ---------------- PROOF ----------------
% 1.73/1.96 % SZS status Unsatisfiable
% 1.73/1.96 % SZS output start Refutation
% See solution above
% 1.73/1.96 ------------ end of proof -------------
% 1.73/1.96
% 1.73/1.96
% 1.73/1.96 Search stopped by max_proofs option.
% 1.73/1.96
% 1.73/1.96
% 1.73/1.96 Search stopped by max_proofs option.
% 1.73/1.96
% 1.73/1.96 ============ end of search ============
% 1.73/1.96
% 1.73/1.96 -------------- statistics -------------
% 1.73/1.96 clauses given 30
% 1.73/1.96 clauses generated 771
% 1.73/1.96 clauses kept 332
% 1.73/1.96 clauses forward subsumed 599
% 1.73/1.96 clauses back subsumed 0
% 1.73/1.96 Kbytes malloced 2929
% 1.73/1.96
% 1.73/1.96 ----------- times (seconds) -----------
% 1.73/1.96 user CPU time 0.02 (0 hr, 0 min, 0 sec)
% 1.73/1.96 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.73/1.96 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.73/1.96
% 1.73/1.96 That finishes the proof of the theorem.
% 1.73/1.96
% 1.73/1.96 Process 21434 finished Wed Jul 27 04:12:35 2022
% 1.80/1.96 Otter interrupted
% 1.80/1.96 PROOF FOUND
%------------------------------------------------------------------------------