TSTP Solution File: RNG040-2 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : RNG040-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n015.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:09 EDT 2022
% Result : Unsatisfiable 1.87s 2.09s
% Output : Refutation 1.87s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 7
% Syntax : Number of clauses : 12 ( 10 unt; 0 nHn; 12 RR)
% Number of literals : 17 ( 0 equ; 6 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 7 con; 0-0 aty)
% Number of variables : 10 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(6,axiom,
( ~ product(A,B,C)
| ~ product(A,D,E)
| ~ sum(B,D,F)
| ~ product(A,F,G)
| sum(C,E,G) ),
file('RNG040-2.p',unknown),
[] ).
cnf(10,axiom,
( ~ product(A,B,C)
| product(B,A,C) ),
file('RNG040-2.p',unknown),
[] ).
cnf(11,axiom,
~ sum(l,n,additive_identity),
file('RNG040-2.p',unknown),
[] ).
cnf(40,axiom,
sum(b,c,d),
file('RNG040-2.p',unknown),
[] ).
cnf(41,axiom,
product(d,a,additive_identity),
file('RNG040-2.p',unknown),
[] ).
cnf(42,axiom,
product(b,a,l),
file('RNG040-2.p',unknown),
[] ).
cnf(43,axiom,
product(c,a,n),
file('RNG040-2.p',unknown),
[] ).
cnf(85,plain,
product(a,d,additive_identity),
inference(hyper,[status(thm)],[41,10]),
[iquote('hyper,41,10')] ).
cnf(101,plain,
product(a,b,l),
inference(hyper,[status(thm)],[42,10]),
[iquote('hyper,42,10')] ).
cnf(116,plain,
product(a,c,n),
inference(hyper,[status(thm)],[43,10]),
[iquote('hyper,43,10')] ).
cnf(302,plain,
sum(l,n,additive_identity),
inference(hyper,[status(thm)],[116,6,101,40,85]),
[iquote('hyper,116,6,101,40,85')] ).
cnf(303,plain,
$false,
inference(binary,[status(thm)],[302,11]),
[iquote('binary,302.1,11.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : RNG040-2 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n015.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 02:19:11 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.87/2.08 ----- Otter 3.3f, August 2004 -----
% 1.87/2.08 The process was started by sandbox on n015.cluster.edu,
% 1.87/2.08 Wed Jul 27 02:19:11 2022
% 1.87/2.08 The command was "./otter". The process ID is 18952.
% 1.87/2.08
% 1.87/2.08 set(prolog_style_variables).
% 1.87/2.08 set(auto).
% 1.87/2.08 dependent: set(auto1).
% 1.87/2.08 dependent: set(process_input).
% 1.87/2.08 dependent: clear(print_kept).
% 1.87/2.08 dependent: clear(print_new_demod).
% 1.87/2.08 dependent: clear(print_back_demod).
% 1.87/2.08 dependent: clear(print_back_sub).
% 1.87/2.08 dependent: set(control_memory).
% 1.87/2.08 dependent: assign(max_mem, 12000).
% 1.87/2.08 dependent: assign(pick_given_ratio, 4).
% 1.87/2.08 dependent: assign(stats_level, 1).
% 1.87/2.08 dependent: assign(max_seconds, 10800).
% 1.87/2.08 clear(print_given).
% 1.87/2.08
% 1.87/2.08 list(usable).
% 1.87/2.08 0 [] A=A.
% 1.87/2.08 0 [] sum(additive_identity,X,X).
% 1.87/2.08 0 [] sum(X,additive_identity,X).
% 1.87/2.08 0 [] product(X,Y,multiply(X,Y)).
% 1.87/2.08 0 [] sum(X,Y,add(X,Y)).
% 1.87/2.08 0 [] sum(additive_inverse(X),X,additive_identity).
% 1.87/2.08 0 [] sum(X,additive_inverse(X),additive_identity).
% 1.87/2.08 0 [] -sum(X,Y,U)| -sum(Y,Z,V)| -sum(U,Z,W)|sum(X,V,W).
% 1.87/2.08 0 [] -sum(X,Y,U)| -sum(Y,Z,V)| -sum(X,V,W)|sum(U,Z,W).
% 1.87/2.08 0 [] -sum(X,Y,Z)|sum(Y,X,Z).
% 1.87/2.08 0 [] -product(X,Y,U)| -product(Y,Z,V)| -product(U,Z,W)|product(X,V,W).
% 1.87/2.08 0 [] -product(X,Y,U)| -product(Y,Z,V)| -product(X,V,W)|product(U,Z,W).
% 1.87/2.08 0 [] -product(X,Y,V1)| -product(X,Z,V2)| -sum(Y,Z,V3)| -product(X,V3,V4)|sum(V1,V2,V4).
% 1.87/2.08 0 [] -product(X,Y,V1)| -product(X,Z,V2)| -sum(Y,Z,V3)| -sum(V1,V2,V4)|product(X,V3,V4).
% 1.87/2.08 0 [] -sum(X,Y,U)| -sum(X,Y,V)|U=V.
% 1.87/2.08 0 [] -product(X,Y,U)| -product(X,Y,V)|U=V.
% 1.87/2.08 0 [] product(A,multiplicative_identity,A).
% 1.87/2.08 0 [] product(multiplicative_identity,A,A).
% 1.87/2.08 0 [] product(A,h(A),multiplicative_identity)|A=additive_identity.
% 1.87/2.08 0 [] product(h(A),A,multiplicative_identity)|A=additive_identity.
% 1.87/2.08 0 [] -product(A,B,C)|product(B,A,C).
% 1.87/2.08 0 [] sum(b,c,d).
% 1.87/2.08 0 [] product(d,a,additive_identity).
% 1.87/2.08 0 [] product(b,a,l).
% 1.87/2.08 0 [] product(c,a,n).
% 1.87/2.08 0 [] -sum(l,n,additive_identity).
% 1.87/2.08 end_of_list.
% 1.87/2.08
% 1.87/2.08 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 1.87/2.08
% 1.87/2.08 This ia a non-Horn set with equality. The strategy will be
% 1.87/2.08 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.87/2.08 deletion, with positive clauses in sos and nonpositive
% 1.87/2.08 clauses in usable.
% 1.87/2.08
% 1.87/2.08 dependent: set(knuth_bendix).
% 1.87/2.08 dependent: set(anl_eq).
% 1.87/2.08 dependent: set(para_from).
% 1.87/2.08 dependent: set(para_into).
% 1.87/2.08 dependent: clear(para_from_right).
% 1.87/2.08 dependent: clear(para_into_right).
% 1.87/2.08 dependent: set(para_from_vars).
% 1.87/2.08 dependent: set(eq_units_both_ways).
% 1.87/2.08 dependent: set(dynamic_demod_all).
% 1.87/2.08 dependent: set(dynamic_demod).
% 1.87/2.08 dependent: set(order_eq).
% 1.87/2.08 dependent: set(back_demod).
% 1.87/2.08 dependent: set(lrpo).
% 1.87/2.08 dependent: set(hyper_res).
% 1.87/2.08 dependent: set(unit_deletion).
% 1.87/2.08 dependent: set(factor).
% 1.87/2.08
% 1.87/2.08 ------------> process usable:
% 1.87/2.08 ** KEPT (pick-wt=16): 1 [] -sum(A,B,C)| -sum(B,D,E)| -sum(C,D,F)|sum(A,E,F).
% 1.87/2.08 ** KEPT (pick-wt=16): 2 [] -sum(A,B,C)| -sum(B,D,E)| -sum(A,E,F)|sum(C,D,F).
% 1.87/2.08 ** KEPT (pick-wt=8): 3 [] -sum(A,B,C)|sum(B,A,C).
% 1.87/2.08 ** KEPT (pick-wt=16): 4 [] -product(A,B,C)| -product(B,D,E)| -product(C,D,F)|product(A,E,F).
% 1.87/2.08 ** KEPT (pick-wt=16): 5 [] -product(A,B,C)| -product(B,D,E)| -product(A,E,F)|product(C,D,F).
% 1.87/2.08 ** 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.87/2.08 ** 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.87/2.08 ** KEPT (pick-wt=11): 8 [] -sum(A,B,C)| -sum(A,B,D)|C=D.
% 1.87/2.08 ** KEPT (pick-wt=11): 9 [] -product(A,B,C)| -product(A,B,D)|C=D.
% 1.87/2.08 ** KEPT (pick-wt=8): 10 [] -product(A,B,C)|product(B,A,C).
% 1.87/2.08 ** KEPT (pick-wt=4): 11 [] -sum(l,n,additive_identity).
% 1.87/2.08
% 1.87/2.08 ------------> process sos:
% 1.87/2.08 ** KEPT (pick-wt=3): 29 [] A=A.
% 1.87/2.08 ** KEPT (pick-wt=4): 30 [] sum(additive_identity,A,A).
% 1.87/2.08 ** KEPT (pick-wt=4): 31 [] sum(A,additive_identity,A).
% 1.87/2.08 ** KEPT (pick-wt=6): 32 [] product(A,B,multiply(A,B)).
% 1.87/2.08 ** KEPT (pick-wt=6): 33 [] sum(A,B,add(A,B)).
% 1.87/2.08 ** KEPT (pick-wt=5): 34 [] sum(additive_inverse(A),A,additive_identity).
% 1.87/2.08 ** KEPT (pick-wt=5): 35 [] sum(A,additive_inverse(A),additive_identity).
% 1.87/2.08 ** KEPT (pick-wt=4): 36 [] product(A,multiplicative_identity,A).
% 1.87/2.08 ** KEPT (pick-wt=4): 37 [] product(multiplicative_identity,A,A).
% 1.87/2.08 ** KEPT (pick-wt=8): 38 [] product(A,h(A),multiplicative_identity)|A=additive_identity.
% 1.87/2.08 ** KEPT (pick-wt=8): 39 [] product(h(A),A,multiplicative_identity)|A=additive_identity.
% 1.87/2.09 ** KEPT (pick-wt=4): 40 [] sum(b,c,d).
% 1.87/2.09 ** KEPT (pick-wt=4): 41 [] product(d,a,additive_identity).
% 1.87/2.09 ** KEPT (pick-wt=4): 42 [] product(b,a,l).
% 1.87/2.09 ** KEPT (pick-wt=4): 43 [] product(c,a,n).
% 1.87/2.09 Following clause subsumed by 29 during input processing: 0 [copy,29,flip.1] A=A.
% 1.87/2.09 29 back subsumes 26.
% 1.87/2.09 29 back subsumes 25.
% 1.87/2.09
% 1.87/2.09 ======= end of input processing =======
% 1.87/2.09
% 1.87/2.09 =========== start of search ===========
% 1.87/2.09
% 1.87/2.09 -------- PROOF --------
% 1.87/2.09
% 1.87/2.09 ----> UNIT CONFLICT at 0.01 sec ----> 303 [binary,302.1,11.1] $F.
% 1.87/2.09
% 1.87/2.09 Length of proof is 4. Level of proof is 2.
% 1.87/2.09
% 1.87/2.09 ---------------- PROOF ----------------
% 1.87/2.09 % SZS status Unsatisfiable
% 1.87/2.09 % SZS output start Refutation
% See solution above
% 1.87/2.09 ------------ end of proof -------------
% 1.87/2.09
% 1.87/2.09
% 1.87/2.09 Search stopped by max_proofs option.
% 1.87/2.09
% 1.87/2.09
% 1.87/2.09 Search stopped by max_proofs option.
% 1.87/2.09
% 1.87/2.09 ============ end of search ============
% 1.87/2.09
% 1.87/2.09 -------------- statistics -------------
% 1.87/2.09 clauses given 15
% 1.87/2.09 clauses generated 1072
% 1.87/2.09 clauses kept 290
% 1.87/2.09 clauses forward subsumed 814
% 1.87/2.09 clauses back subsumed 9
% 1.87/2.09 Kbytes malloced 1953
% 1.87/2.09
% 1.87/2.09 ----------- times (seconds) -----------
% 1.87/2.09 user CPU time 0.02 (0 hr, 0 min, 0 sec)
% 1.87/2.09 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.87/2.09 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.87/2.09
% 1.87/2.09 That finishes the proof of the theorem.
% 1.87/2.09
% 1.87/2.09 Process 18952 finished Wed Jul 27 02:19:13 2022
% 1.87/2.09 Otter interrupted
% 1.87/2.09 PROOF FOUND
%------------------------------------------------------------------------------