TSTP Solution File: ROB009-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : ROB009-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n006.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.75s 1.98s
% Output : Refutation 1.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of clauses : 12 ( 12 unt; 0 nHn; 5 RR)
% Number of literals : 12 ( 11 equ; 2 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 : 18 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
a != b,
file('ROB009-1.p',unknown),
[] ).
cnf(2,plain,
b != a,
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[1])]),
[iquote('copy,1,flip.1')] ).
cnf(4,axiom,
add(A,B) = add(B,A),
file('ROB009-1.p',unknown),
[] ).
cnf(6,axiom,
add(add(A,B),C) = add(A,add(B,C)),
file('ROB009-1.p',unknown),
[] ).
cnf(7,axiom,
negate(add(negate(add(A,B)),negate(add(A,negate(B))))) = A,
file('ROB009-1.p',unknown),
[] ).
cnf(9,axiom,
negate(add(a,negate(add(b,c)))) = negate(add(b,negate(add(a,c)))),
file('ROB009-1.p',unknown),
[] ).
cnf(11,plain,
add(A,add(B,C)) = add(B,add(A,C)),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[6,4]),6]),
[iquote('para_into,5.1.1.1,4.1.1,demod,6')] ).
cnf(16,plain,
add(A,add(B,C)) = add(A,add(C,B)),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[11,4]),6]),
[iquote('para_into,11.1.1,4.1.1,demod,6')] ).
cnf(30,plain,
negate(add(negate(add(A,B)),negate(add(B,negate(A))))) = B,
inference(para_into,[status(thm),theory(equality)],[7,4]),
[iquote('para_into,7.1.1.1.1.1,4.1.1')] ).
cnf(55,plain,
negate(add(negate(add(A,add(B,C))),negate(add(A,negate(add(C,B)))))) = A,
inference(para_from,[status(thm),theory(equality)],[16,7]),
[iquote('para_from,16.1.1,7.1.1.1.1.1')] ).
cnf(98,plain,
b = a,
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[9,30]),6,55]),
[iquote('para_from,9.1.1,30.1.1.1.2,demod,6,55')] ).
cnf(100,plain,
$false,
inference(binary,[status(thm)],[98,2]),
[iquote('binary,98.1,2.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : ROB009-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n006.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:01 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.75/1.98 ----- Otter 3.3f, August 2004 -----
% 1.75/1.98 The process was started by sandbox on n006.cluster.edu,
% 1.75/1.98 Wed Jul 27 04:03:02 2022
% 1.75/1.98 The command was "./otter". The process ID is 29930.
% 1.75/1.98
% 1.75/1.98 set(prolog_style_variables).
% 1.75/1.98 set(auto).
% 1.75/1.98 dependent: set(auto1).
% 1.75/1.98 dependent: set(process_input).
% 1.75/1.98 dependent: clear(print_kept).
% 1.75/1.98 dependent: clear(print_new_demod).
% 1.75/1.98 dependent: clear(print_back_demod).
% 1.75/1.98 dependent: clear(print_back_sub).
% 1.75/1.98 dependent: set(control_memory).
% 1.75/1.98 dependent: assign(max_mem, 12000).
% 1.75/1.98 dependent: assign(pick_given_ratio, 4).
% 1.75/1.98 dependent: assign(stats_level, 1).
% 1.75/1.98 dependent: assign(max_seconds, 10800).
% 1.75/1.98 clear(print_given).
% 1.75/1.98
% 1.75/1.98 list(usable).
% 1.75/1.98 0 [] A=A.
% 1.75/1.98 0 [] add(X,Y)=add(Y,X).
% 1.75/1.98 0 [] add(add(X,Y),Z)=add(X,add(Y,Z)).
% 1.75/1.98 0 [] negate(add(negate(add(X,Y)),negate(add(X,negate(Y)))))=X.
% 1.75/1.98 0 [] negate(add(a,negate(add(b,c))))=negate(add(b,negate(add(a,c)))).
% 1.75/1.98 0 [] a!=b.
% 1.75/1.98 end_of_list.
% 1.75/1.98
% 1.75/1.98 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 1.75/1.98
% 1.75/1.98 All clauses are units, and equality is present; the
% 1.75/1.98 strategy will be Knuth-Bendix with positive clauses in sos.
% 1.75/1.98
% 1.75/1.98 dependent: set(knuth_bendix).
% 1.75/1.98 dependent: set(anl_eq).
% 1.75/1.98 dependent: set(para_from).
% 1.75/1.98 dependent: set(para_into).
% 1.75/1.98 dependent: clear(para_from_right).
% 1.75/1.98 dependent: clear(para_into_right).
% 1.75/1.98 dependent: set(para_from_vars).
% 1.75/1.98 dependent: set(eq_units_both_ways).
% 1.75/1.98 dependent: set(dynamic_demod_all).
% 1.75/1.98 dependent: set(dynamic_demod).
% 1.75/1.98 dependent: set(order_eq).
% 1.75/1.98 dependent: set(back_demod).
% 1.75/1.98 dependent: set(lrpo).
% 1.75/1.98
% 1.75/1.98 ------------> process usable:
% 1.75/1.98 ** KEPT (pick-wt=3): 2 [copy,1,flip.1] b!=a.
% 1.75/1.98
% 1.75/1.98 ------------> process sos:
% 1.75/1.98 ** KEPT (pick-wt=3): 3 [] A=A.
% 1.75/1.98 ** KEPT (pick-wt=7): 4 [] add(A,B)=add(B,A).
% 1.75/1.98 ** KEPT (pick-wt=11): 5 [] add(add(A,B),C)=add(A,add(B,C)).
% 1.75/1.98 ---> New Demodulator: 6 [new_demod,5] add(add(A,B),C)=add(A,add(B,C)).
% 1.75/1.98 ** KEPT (pick-wt=13): 7 [] negate(add(negate(add(A,B)),negate(add(A,negate(B)))))=A.
% 1.75/1.98 ---> New Demodulator: 8 [new_demod,7] negate(add(negate(add(A,B)),negate(add(A,negate(B)))))=A.
% 1.75/1.98 ** KEPT (pick-wt=15): 9 [] negate(add(a,negate(add(b,c))))=negate(add(b,negate(add(a,c)))).
% 1.75/1.98 ---> New Demodulator: 10 [new_demod,9] negate(add(a,negate(add(b,c))))=negate(add(b,negate(add(a,c)))).
% 1.75/1.98 Following clause subsumed by 3 during input processing: 0 [copy,3,flip.1] A=A.
% 1.75/1.98 Following clause subsumed by 4 during input processing: 0 [copy,4,flip.1] add(A,B)=add(B,A).
% 1.75/1.98 >>>> Starting back demodulation with 6.
% 1.75/1.98 >>>> Starting back demodulation with 8.
% 1.75/1.98 >>>> Starting back demodulation with 10.
% 1.75/1.98
% 1.75/1.98 ======= end of input processing =======
% 1.75/1.98
% 1.75/1.98 =========== start of search ===========
% 1.75/1.98
% 1.75/1.98 -------- PROOF --------
% 1.75/1.98
% 1.75/1.98 ----> UNIT CONFLICT at 0.01 sec ----> 100 [binary,98.1,2.1] $F.
% 1.75/1.98
% 1.75/1.98 Length of proof is 6. Level of proof is 4.
% 1.75/1.98
% 1.75/1.98 ---------------- PROOF ----------------
% 1.75/1.98 % SZS status Unsatisfiable
% 1.75/1.98 % SZS output start Refutation
% See solution above
% 1.75/1.98 ------------ end of proof -------------
% 1.75/1.98
% 1.75/1.98
% 1.75/1.98 Search stopped by max_proofs option.
% 1.75/1.98
% 1.75/1.98
% 1.75/1.98 Search stopped by max_proofs option.
% 1.75/1.98
% 1.75/1.98 ============ end of search ============
% 1.75/1.98
% 1.75/1.98 -------------- statistics -------------
% 1.75/1.98 clauses given 11
% 1.75/1.98 clauses generated 152
% 1.75/1.98 clauses kept 64
% 1.75/1.98 clauses forward subsumed 123
% 1.75/1.98 clauses back subsumed 0
% 1.75/1.98 Kbytes malloced 976
% 1.75/1.98
% 1.75/1.98 ----------- times (seconds) -----------
% 1.75/1.98 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.75/1.98 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.75/1.98 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.75/1.98
% 1.75/1.98 That finishes the proof of the theorem.
% 1.75/1.98
% 1.75/1.98 Process 29930 finished Wed Jul 27 04:03:03 2022
% 1.75/1.98 Otter interrupted
% 1.75/1.98 PROOF FOUND
%------------------------------------------------------------------------------