TSTP Solution File: ROB002-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : ROB002-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:21 EDT 2022
% Result : Unsatisfiable 1.60s 1.80s
% Output : Refutation 1.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of clauses : 10 ( 10 unt; 0 nHn; 4 RR)
% Number of literals : 10 ( 9 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 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 : 10 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
add(negate(add(a,negate(b))),negate(add(negate(a),negate(b)))) != b,
file('ROB002-1.p',unknown),
[] ).
cnf(2,axiom,
A = A,
file('ROB002-1.p',unknown),
[] ).
cnf(3,axiom,
add(A,B) = add(B,A),
file('ROB002-1.p',unknown),
[] ).
cnf(6,axiom,
negate(add(negate(add(A,B)),negate(add(A,negate(B))))) = A,
file('ROB002-1.p',unknown),
[] ).
cnf(9,axiom,
negate(negate(A)) = A,
file('ROB002-1.p',unknown),
[] ).
cnf(11,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(23,plain,
negate(add(negate(add(A,B)),negate(add(B,negate(A))))) = B,
inference(para_into,[status(thm),theory(equality)],[6,3]),
[iquote('para_into,6.1.1.1.1.1,3.1.1')] ).
cnf(85,plain,
add(negate(add(A,B)),negate(add(B,negate(A)))) = negate(B),
inference(flip,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[23,9])]),
[iquote('para_from,23.1.1,8.1.1.1,flip.1')] ).
cnf(86,plain,
b != b,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[11]),85,9]),
[iquote('back_demod,11,demod,85,9')] ).
cnf(87,plain,
$false,
inference(binary,[status(thm)],[86,2]),
[iquote('binary,86.1,2.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : ROB002-1 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n028.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:12:48 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.60/1.80 ----- Otter 3.3f, August 2004 -----
% 1.60/1.80 The process was started by sandbox on n028.cluster.edu,
% 1.60/1.80 Wed Jul 27 04:12:49 2022
% 1.60/1.80 The command was "./otter". The process ID is 23191.
% 1.60/1.80
% 1.60/1.80 set(prolog_style_variables).
% 1.60/1.80 set(auto).
% 1.60/1.80 dependent: set(auto1).
% 1.60/1.80 dependent: set(process_input).
% 1.60/1.80 dependent: clear(print_kept).
% 1.60/1.80 dependent: clear(print_new_demod).
% 1.60/1.80 dependent: clear(print_back_demod).
% 1.60/1.80 dependent: clear(print_back_sub).
% 1.60/1.80 dependent: set(control_memory).
% 1.60/1.80 dependent: assign(max_mem, 12000).
% 1.60/1.80 dependent: assign(pick_given_ratio, 4).
% 1.60/1.80 dependent: assign(stats_level, 1).
% 1.60/1.80 dependent: assign(max_seconds, 10800).
% 1.60/1.80 clear(print_given).
% 1.60/1.80
% 1.60/1.80 list(usable).
% 1.60/1.80 0 [] A=A.
% 1.60/1.80 0 [] add(X,Y)=add(Y,X).
% 1.60/1.80 0 [] add(add(X,Y),Z)=add(X,add(Y,Z)).
% 1.60/1.80 0 [] negate(add(negate(add(X,Y)),negate(add(X,negate(Y)))))=X.
% 1.60/1.80 0 [] negate(negate(X))=X.
% 1.60/1.80 0 [] add(negate(add(a,negate(b))),negate(add(negate(a),negate(b))))!=b.
% 1.60/1.80 end_of_list.
% 1.60/1.80
% 1.60/1.80 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 1.60/1.80
% 1.60/1.80 All clauses are units, and equality is present; the
% 1.60/1.80 strategy will be Knuth-Bendix with positive clauses in sos.
% 1.60/1.80
% 1.60/1.80 dependent: set(knuth_bendix).
% 1.60/1.80 dependent: set(anl_eq).
% 1.60/1.80 dependent: set(para_from).
% 1.60/1.80 dependent: set(para_into).
% 1.60/1.80 dependent: clear(para_from_right).
% 1.60/1.80 dependent: clear(para_into_right).
% 1.60/1.80 dependent: set(para_from_vars).
% 1.60/1.80 dependent: set(eq_units_both_ways).
% 1.60/1.80 dependent: set(dynamic_demod_all).
% 1.60/1.80 dependent: set(dynamic_demod).
% 1.60/1.80 dependent: set(order_eq).
% 1.60/1.80 dependent: set(back_demod).
% 1.60/1.80 dependent: set(lrpo).
% 1.60/1.80
% 1.60/1.80 ------------> process usable:
% 1.60/1.80 ** KEPT (pick-wt=14): 1 [] add(negate(add(a,negate(b))),negate(add(negate(a),negate(b))))!=b.
% 1.60/1.80
% 1.60/1.80 ------------> process sos:
% 1.60/1.80 ** KEPT (pick-wt=3): 2 [] A=A.
% 1.60/1.80 ** KEPT (pick-wt=7): 3 [] add(A,B)=add(B,A).
% 1.60/1.80 ** KEPT (pick-wt=11): 4 [] add(add(A,B),C)=add(A,add(B,C)).
% 1.60/1.80 ---> New Demodulator: 5 [new_demod,4] add(add(A,B),C)=add(A,add(B,C)).
% 1.60/1.80 ** KEPT (pick-wt=13): 6 [] negate(add(negate(add(A,B)),negate(add(A,negate(B)))))=A.
% 1.60/1.80 ---> New Demodulator: 7 [new_demod,6] negate(add(negate(add(A,B)),negate(add(A,negate(B)))))=A.
% 1.60/1.80 ** KEPT (pick-wt=5): 8 [] negate(negate(A))=A.
% 1.60/1.80 ---> New Demodulator: 9 [new_demod,8] negate(negate(A))=A.
% 1.60/1.80 Following clause subsumed by 2 during input processing: 0 [copy,2,flip.1] A=A.
% 1.60/1.80 Following clause subsumed by 3 during input processing: 0 [copy,3,flip.1] add(A,B)=add(B,A).
% 1.60/1.80 >>>> Starting back demodulation with 5.
% 1.60/1.80 >>>> Starting back demodulation with 7.
% 1.60/1.80 >>>> Starting back demodulation with 9.
% 1.60/1.80
% 1.60/1.80 ======= end of input processing =======
% 1.60/1.80
% 1.60/1.80 =========== start of search ===========
% 1.60/1.80
% 1.60/1.80 -------- PROOF --------
% 1.60/1.80
% 1.60/1.80 ----> UNIT CONFLICT at 0.00 sec ----> 87 [binary,86.1,2.1] $F.
% 1.60/1.80
% 1.60/1.80 Length of proof is 4. Level of proof is 3.
% 1.60/1.80
% 1.60/1.80 ---------------- PROOF ----------------
% 1.60/1.80 % SZS status Unsatisfiable
% 1.60/1.80 % SZS output start Refutation
% See solution above
% 1.60/1.80 ------------ end of proof -------------
% 1.60/1.80
% 1.60/1.80
% 1.60/1.80 Search stopped by max_proofs option.
% 1.60/1.80
% 1.60/1.80
% 1.60/1.80 Search stopped by max_proofs option.
% 1.60/1.80
% 1.60/1.80 ============ end of search ============
% 1.60/1.80
% 1.60/1.80 -------------- statistics -------------
% 1.60/1.80 clauses given 12
% 1.60/1.80 clauses generated 150
% 1.60/1.80 clauses kept 61
% 1.60/1.80 clauses forward subsumed 128
% 1.60/1.80 clauses back subsumed 0
% 1.60/1.80 Kbytes malloced 976
% 1.60/1.80
% 1.60/1.80 ----------- times (seconds) -----------
% 1.60/1.80 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.60/1.80 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.60/1.80 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.60/1.80
% 1.60/1.80 That finishes the proof of the theorem.
% 1.60/1.80
% 1.60/1.80 Process 23191 finished Wed Jul 27 04:12:50 2022
% 1.60/1.80 Otter interrupted
% 1.60/1.80 PROOF FOUND
%------------------------------------------------------------------------------