TSTP Solution File: RNG002-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : RNG002-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n010.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:00 EDT 2022
% Result : Unsatisfiable 1.67s 1.90s
% Output : Refutation 1.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 9
% Syntax : Number of clauses : 15 ( 12 unt; 0 nHn; 11 RR)
% Number of literals : 23 ( 5 equ; 10 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 21 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ sum(A,B,C)
| ~ sum(B,D,E)
| ~ sum(C,D,F)
| sum(A,E,F) ),
file('RNG002-1.p',unknown),
[] ).
cnf(2,axiom,
( ~ sum(A,B,C)
| ~ sum(B,D,E)
| ~ sum(A,E,F)
| sum(C,D,F) ),
file('RNG002-1.p',unknown),
[] ).
cnf(10,axiom,
( ~ sum(A,B,C)
| ~ sum(A,B,D)
| C = D ),
file('RNG002-1.p',unknown),
[] ).
cnf(12,axiom,
b != c,
file('RNG002-1.p',unknown),
[] ).
cnf(13,plain,
c != b,
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[12])]),
[iquote('copy,12,flip.1')] ).
cnf(15,axiom,
sum(additive_identity,A,A),
file('RNG002-1.p',unknown),
[] ).
cnf(18,axiom,
sum(A,B,add(A,B)),
file('RNG002-1.p',unknown),
[] ).
cnf(19,axiom,
sum(additive_inverse(A),A,additive_identity),
file('RNG002-1.p',unknown),
[] ).
cnf(21,axiom,
sum(a,b,d),
file('RNG002-1.p',unknown),
[] ).
cnf(22,axiom,
sum(a,c,d),
file('RNG002-1.p',unknown),
[] ).
cnf(77,plain,
sum(additive_inverse(a),d,c),
inference(hyper,[status(thm)],[19,1,22,15]),
[iquote('hyper,19,1,22,15')] ).
cnf(98,plain,
add(additive_identity,A) = A,
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[18,10,15])]),
[iquote('hyper,18,10,15,flip.1')] ).
cnf(250,plain,
sum(additive_identity,b,c),
inference(hyper,[status(thm)],[77,2,19,21]),
[iquote('hyper,77,2,19,21')] ).
cnf(274,plain,
c = b,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[250,10,18]),98])]),
[iquote('hyper,250,10,18,demod,98,flip.1')] ).
cnf(276,plain,
$false,
inference(binary,[status(thm)],[274,13]),
[iquote('binary,274.1,13.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : RNG002-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.11/0.33 % Computer : n010.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Wed Jul 27 02:06:39 EDT 2022
% 0.11/0.33 % CPUTime :
% 1.67/1.90 ----- Otter 3.3f, August 2004 -----
% 1.67/1.90 The process was started by sandbox on n010.cluster.edu,
% 1.67/1.90 Wed Jul 27 02:06:40 2022
% 1.67/1.90 The command was "./otter". The process ID is 28484.
% 1.67/1.90
% 1.67/1.90 set(prolog_style_variables).
% 1.67/1.90 set(auto).
% 1.67/1.90 dependent: set(auto1).
% 1.67/1.90 dependent: set(process_input).
% 1.67/1.90 dependent: clear(print_kept).
% 1.67/1.90 dependent: clear(print_new_demod).
% 1.67/1.90 dependent: clear(print_back_demod).
% 1.67/1.90 dependent: clear(print_back_sub).
% 1.67/1.90 dependent: set(control_memory).
% 1.67/1.90 dependent: assign(max_mem, 12000).
% 1.67/1.90 dependent: assign(pick_given_ratio, 4).
% 1.67/1.90 dependent: assign(stats_level, 1).
% 1.67/1.90 dependent: assign(max_seconds, 10800).
% 1.67/1.90 clear(print_given).
% 1.67/1.90
% 1.67/1.90 list(usable).
% 1.67/1.90 0 [] A=A.
% 1.67/1.90 0 [] sum(additive_identity,X,X).
% 1.67/1.90 0 [] sum(X,additive_identity,X).
% 1.67/1.90 0 [] product(X,Y,multiply(X,Y)).
% 1.67/1.90 0 [] sum(X,Y,add(X,Y)).
% 1.67/1.90 0 [] sum(additive_inverse(X),X,additive_identity).
% 1.67/1.90 0 [] sum(X,additive_inverse(X),additive_identity).
% 1.67/1.90 0 [] -sum(X,Y,U)| -sum(Y,Z,V)| -sum(U,Z,W)|sum(X,V,W).
% 1.67/1.90 0 [] -sum(X,Y,U)| -sum(Y,Z,V)| -sum(X,V,W)|sum(U,Z,W).
% 1.67/1.90 0 [] -sum(X,Y,Z)|sum(Y,X,Z).
% 1.67/1.90 0 [] -product(X,Y,U)| -product(Y,Z,V)| -product(U,Z,W)|product(X,V,W).
% 1.67/1.90 0 [] -product(X,Y,U)| -product(Y,Z,V)| -product(X,V,W)|product(U,Z,W).
% 1.67/1.90 0 [] -product(X,Y,V1)| -product(X,Z,V2)| -sum(Y,Z,V3)| -product(X,V3,V4)|sum(V1,V2,V4).
% 1.67/1.90 0 [] -product(X,Y,V1)| -product(X,Z,V2)| -sum(Y,Z,V3)| -sum(V1,V2,V4)|product(X,V3,V4).
% 1.67/1.90 0 [] -product(Y,X,V1)| -product(Z,X,V2)| -sum(Y,Z,V3)| -product(V3,X,V4)|sum(V1,V2,V4).
% 1.67/1.90 0 [] -product(Y,X,V1)| -product(Z,X,V2)| -sum(Y,Z,V3)| -sum(V1,V2,V4)|product(V3,X,V4).
% 1.67/1.90 0 [] -sum(X,Y,U)| -sum(X,Y,V)|U=V.
% 1.67/1.90 0 [] -product(X,Y,U)| -product(X,Y,V)|U=V.
% 1.67/1.90 0 [] sum(a,b,d).
% 1.67/1.90 0 [] sum(a,c,d).
% 1.67/1.90 0 [] b!=c.
% 1.67/1.90 end_of_list.
% 1.67/1.90
% 1.67/1.90 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=5.
% 1.67/1.90
% 1.67/1.90 This is a Horn set with equality. The strategy will be
% 1.67/1.90 Knuth-Bendix and hyper_res, with positive clauses in
% 1.67/1.90 sos and nonpositive clauses in usable.
% 1.67/1.90
% 1.67/1.90 dependent: set(knuth_bendix).
% 1.67/1.90 dependent: set(anl_eq).
% 1.67/1.90 dependent: set(para_from).
% 1.67/1.90 dependent: set(para_into).
% 1.67/1.90 dependent: clear(para_from_right).
% 1.67/1.90 dependent: clear(para_into_right).
% 1.67/1.90 dependent: set(para_from_vars).
% 1.67/1.90 dependent: set(eq_units_both_ways).
% 1.67/1.90 dependent: set(dynamic_demod_all).
% 1.67/1.90 dependent: set(dynamic_demod).
% 1.67/1.90 dependent: set(order_eq).
% 1.67/1.90 dependent: set(back_demod).
% 1.67/1.90 dependent: set(lrpo).
% 1.67/1.90 dependent: set(hyper_res).
% 1.67/1.90 dependent: clear(order_hyper).
% 1.67/1.90
% 1.67/1.90 ------------> process usable:
% 1.67/1.90 ** KEPT (pick-wt=16): 1 [] -sum(A,B,C)| -sum(B,D,E)| -sum(C,D,F)|sum(A,E,F).
% 1.67/1.90 ** KEPT (pick-wt=16): 2 [] -sum(A,B,C)| -sum(B,D,E)| -sum(A,E,F)|sum(C,D,F).
% 1.67/1.90 ** KEPT (pick-wt=8): 3 [] -sum(A,B,C)|sum(B,A,C).
% 1.67/1.90 ** KEPT (pick-wt=16): 4 [] -product(A,B,C)| -product(B,D,E)| -product(C,D,F)|product(A,E,F).
% 1.67/1.90 ** KEPT (pick-wt=16): 5 [] -product(A,B,C)| -product(B,D,E)| -product(A,E,F)|product(C,D,F).
% 1.67/1.90 ** KEPT (pick-wt=20): 6 [] -product(A,B,C)| -product(A,D,E)| -sum(B,D,F)| -product(A,F,G)|sum(C,E,G).
% 1.67/1.90 ** KEPT (pick-wt=20): 7 [] -product(A,B,C)| -product(A,D,E)| -sum(B,D,F)| -sum(C,E,G)|product(A,F,G).
% 1.67/1.90 ** KEPT (pick-wt=20): 8 [] -product(A,B,C)| -product(D,B,E)| -sum(A,D,F)| -product(F,B,G)|sum(C,E,G).
% 1.67/1.90 ** KEPT (pick-wt=20): 9 [] -product(A,B,C)| -product(D,B,E)| -sum(A,D,F)| -sum(C,E,G)|product(F,B,G).
% 1.67/1.90 ** KEPT (pick-wt=11): 10 [] -sum(A,B,C)| -sum(A,B,D)|C=D.
% 1.67/1.90 ** KEPT (pick-wt=11): 11 [] -product(A,B,C)| -product(A,B,D)|C=D.
% 1.67/1.90 ** KEPT (pick-wt=3): 13 [copy,12,flip.1] c!=b.
% 1.67/1.90
% 1.67/1.90 ------------> process sos:
% 1.67/1.90 ** KEPT (pick-wt=3): 14 [] A=A.
% 1.67/1.90 ** KEPT (pick-wt=4): 15 [] sum(additive_identity,A,A).
% 1.67/1.90 ** KEPT (pick-wt=4): 16 [] sum(A,additive_identity,A).
% 1.67/1.90 ** KEPT (pick-wt=6): 17 [] product(A,B,multiply(A,B)).
% 1.67/1.90 ** KEPT (pick-wt=6): 18 [] sum(A,B,add(A,B)).
% 1.67/1.90 ** KEPT (pick-wt=5): 19 [] sum(additive_inverse(A),A,additive_identity).
% 1.67/1.90 ** KEPT (pick-wt=5): 20 [] sum(A,additive_inverse(A),additive_identity).
% 1.67/1.90 ** KEPT (pick-wt=4): 21 [] sum(a,b,d).
% 1.67/1.90 ** KEPT (pick-wt=4): 22 [] sum(a,c,d).
% 1.67/1.90 Following clause subsumed by 14 during input processing: 0 [copy,14,flip.1] A=A.
% 1.67/1.90
% 1.67/1.90 ======= end of input processing =======
% 1.67/1.90
% 1.67/1.90 =========== start of search ===========
% 1.67/1.90
% 1.67/1.90 -------- PROOF --------
% 1.67/1.90
% 1.67/1.90 ----> UNIT CONFLICT at 0.01 sec ----> 276 [binary,274.1,13.1] $F.
% 1.67/1.90
% 1.67/1.90 Length of proof is 5. Level of proof is 3.
% 1.67/1.90
% 1.67/1.90 ---------------- PROOF ----------------
% 1.67/1.90 % SZS status Unsatisfiable
% 1.67/1.90 % SZS output start Refutation
% See solution above
% 1.67/1.90 ------------ end of proof -------------
% 1.67/1.90
% 1.67/1.90
% 1.67/1.90 Search stopped by max_proofs option.
% 1.67/1.90
% 1.67/1.90
% 1.67/1.90 Search stopped by max_proofs option.
% 1.67/1.90
% 1.67/1.90 ============ end of search ============
% 1.67/1.90
% 1.67/1.90 -------------- statistics -------------
% 1.67/1.90 clauses given 17
% 1.67/1.90 clauses generated 699
% 1.67/1.90 clauses kept 261
% 1.67/1.90 clauses forward subsumed 464
% 1.67/1.90 clauses back subsumed 1
% 1.67/1.90 Kbytes malloced 1953
% 1.67/1.90
% 1.67/1.90 ----------- times (seconds) -----------
% 1.67/1.90 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.67/1.90 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.67/1.90 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.67/1.90
% 1.67/1.90 That finishes the proof of the theorem.
% 1.67/1.90
% 1.67/1.90 Process 28484 finished Wed Jul 27 02:06:41 2022
% 1.67/1.90 Otter interrupted
% 1.67/1.90 PROOF FOUND
%------------------------------------------------------------------------------