TSTP Solution File: FLD030-4 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : FLD030-4 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n021.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 12:53:46 EDT 2022
% Result : Unsatisfiable 1.92s 2.10s
% Output : Refutation 1.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 6
% Syntax : Number of clauses : 9 ( 7 unt; 0 nHn; 9 RR)
% Number of literals : 13 ( 0 equ; 5 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 7 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(7,axiom,
( product(A,B,C)
| ~ product(D,E,A)
| ~ product(E,B,F)
| ~ product(D,F,C) ),
file('FLD030-4.p',unknown),
[] ).
cnf(8,axiom,
( product(multiplicative_identity,A,A)
| ~ defined(A) ),
file('FLD030-4.p',unknown),
[] ).
cnf(25,axiom,
~ product(d,b,c),
file('FLD030-4.p',unknown),
[] ).
cnf(53,axiom,
defined(c),
file('FLD030-4.p',unknown),
[] ).
cnf(55,axiom,
product(a,b,c),
file('FLD030-4.p',unknown),
[] ).
cnf(56,axiom,
product(multiplicative_identity,a,d),
file('FLD030-4.p',unknown),
[] ).
cnf(199,plain,
product(multiplicative_identity,c,c),
inference(hyper,[status(thm)],[53,8]),
[iquote('hyper,53,8')] ).
cnf(9988,plain,
product(d,b,c),
inference(hyper,[status(thm)],[199,7,56,55]),
[iquote('hyper,199,7,56,55')] ).
cnf(9989,plain,
$false,
inference(binary,[status(thm)],[9988,25]),
[iquote('binary,9988.1,25.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : FLD030-4 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.07/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n021.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 03:10:53 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.71/1.90 ----- Otter 3.3f, August 2004 -----
% 1.71/1.90 The process was started by sandbox2 on n021.cluster.edu,
% 1.71/1.90 Wed Jul 27 03:10:53 2022
% 1.71/1.90 The command was "./otter". The process ID is 1401.
% 1.71/1.90
% 1.71/1.90 set(prolog_style_variables).
% 1.71/1.90 set(auto).
% 1.71/1.90 dependent: set(auto1).
% 1.71/1.90 dependent: set(process_input).
% 1.71/1.90 dependent: clear(print_kept).
% 1.71/1.90 dependent: clear(print_new_demod).
% 1.71/1.90 dependent: clear(print_back_demod).
% 1.71/1.90 dependent: clear(print_back_sub).
% 1.71/1.90 dependent: set(control_memory).
% 1.71/1.90 dependent: assign(max_mem, 12000).
% 1.71/1.90 dependent: assign(pick_given_ratio, 4).
% 1.71/1.90 dependent: assign(stats_level, 1).
% 1.71/1.90 dependent: assign(max_seconds, 10800).
% 1.71/1.90 clear(print_given).
% 1.71/1.90
% 1.71/1.90 list(usable).
% 1.71/1.90 0 [] sum(X,V,W)| -sum(X,Y,U)| -sum(Y,Z,V)| -sum(U,Z,W).
% 1.71/1.90 0 [] sum(U,Z,W)| -sum(X,Y,U)| -sum(Y,Z,V)| -sum(X,V,W).
% 1.71/1.90 0 [] sum(additive_identity,X,X)| -defined(X).
% 1.71/1.90 0 [] sum(additive_inverse(X),X,additive_identity)| -defined(X).
% 1.71/1.90 0 [] sum(Y,X,Z)| -sum(X,Y,Z).
% 1.71/1.90 0 [] product(X,V,W)| -product(X,Y,U)| -product(Y,Z,V)| -product(U,Z,W).
% 1.71/1.90 0 [] product(U,Z,W)| -product(X,Y,U)| -product(Y,Z,V)| -product(X,V,W).
% 1.71/1.90 0 [] product(multiplicative_identity,X,X)| -defined(X).
% 1.71/1.90 0 [] product(multiplicative_inverse(X),X,multiplicative_identity)|sum(additive_identity,X,additive_identity)| -defined(X).
% 1.71/1.90 0 [] product(Y,X,Z)| -product(X,Y,Z).
% 1.71/1.90 0 [] sum(C,D,B)| -sum(X,Y,A)| -product(A,Z,B)| -product(X,Z,C)| -product(Y,Z,D).
% 1.71/1.90 0 [] product(A,Z,B)| -sum(X,Y,A)| -product(X,Z,C)| -product(Y,Z,D)| -sum(C,D,B).
% 1.71/1.90 0 [] defined(add(X,Y))| -defined(X)| -defined(Y).
% 1.71/1.90 0 [] defined(additive_identity).
% 1.71/1.90 0 [] defined(additive_inverse(X))| -defined(X).
% 1.71/1.90 0 [] defined(multiply(X,Y))| -defined(X)| -defined(Y).
% 1.71/1.90 0 [] defined(multiplicative_identity).
% 1.71/1.90 0 [] defined(multiplicative_inverse(X))| -defined(X)|sum(additive_identity,X,additive_identity).
% 1.71/1.90 0 [] sum(X,Y,add(X,Y))| -defined(X)| -defined(Y).
% 1.71/1.90 0 [] product(X,Y,multiply(X,Y))| -defined(X)| -defined(Y).
% 1.71/1.90 0 [] sum(additive_identity,X,Y)| -less_or_e_qual(X,Y)| -less_or_e_qual(Y,X).
% 1.71/1.90 0 [] less_or_e_qual(X,Z)| -less_or_e_qual(X,Y)| -less_or_e_qual(Y,Z).
% 1.71/1.90 0 [] less_or_e_qual(X,Y)|less_or_e_qual(Y,X)| -defined(X)| -defined(Y).
% 1.71/1.90 0 [] less_or_e_qual(U,V)| -less_or_e_qual(X,Y)| -sum(X,Z,U)| -sum(Y,Z,V).
% 1.71/1.90 0 [] less_or_e_qual(additive_identity,Z)| -less_or_e_qual(additive_identity,X)| -less_or_e_qual(additive_identity,Y)| -product(X,Y,Z).
% 1.71/1.90 0 [] -sum(additive_identity,additive_identity,multiplicative_identity).
% 1.71/1.90 0 [] defined(a).
% 1.71/1.90 0 [] defined(b).
% 1.71/1.90 0 [] defined(c).
% 1.71/1.90 0 [] defined(d).
% 1.71/1.90 0 [] product(a,b,c).
% 1.71/1.90 0 [] product(multiplicative_identity,a,d).
% 1.71/1.90 0 [] -product(d,b,c).
% 1.71/1.90 end_of_list.
% 1.71/1.90
% 1.71/1.90 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=5.
% 1.71/1.90
% 1.71/1.90 This is a non-Horn set without equality. The strategy will
% 1.71/1.90 be ordered hyper_res, unit deletion, and factoring, with
% 1.71/1.90 satellites in sos and with nuclei in usable.
% 1.71/1.90
% 1.71/1.90 dependent: set(hyper_res).
% 1.71/1.90 dependent: set(factor).
% 1.71/1.90 dependent: set(unit_deletion).
% 1.71/1.90
% 1.71/1.90 ------------> process usable:
% 1.71/1.90 ** KEPT (pick-wt=16): 1 [] sum(A,B,C)| -sum(A,D,E)| -sum(D,F,B)| -sum(E,F,C).
% 1.71/1.90 ** KEPT (pick-wt=16): 2 [] sum(A,B,C)| -sum(D,E,A)| -sum(E,B,F)| -sum(D,F,C).
% 1.71/1.90 ** KEPT (pick-wt=6): 3 [] sum(additive_identity,A,A)| -defined(A).
% 1.71/1.90 ** KEPT (pick-wt=7): 4 [] sum(additive_inverse(A),A,additive_identity)| -defined(A).
% 1.71/1.90 ** KEPT (pick-wt=8): 5 [] sum(A,B,C)| -sum(B,A,C).
% 1.71/1.90 ** KEPT (pick-wt=16): 6 [] product(A,B,C)| -product(A,D,E)| -product(D,F,B)| -product(E,F,C).
% 1.71/1.90 ** KEPT (pick-wt=16): 7 [] product(A,B,C)| -product(D,E,A)| -product(E,B,F)| -product(D,F,C).
% 1.71/1.90 ** KEPT (pick-wt=6): 8 [] product(multiplicative_identity,A,A)| -defined(A).
% 1.71/1.90 ** KEPT (pick-wt=11): 9 [] product(multiplicative_inverse(A),A,multiplicative_identity)|sum(additive_identity,A,additive_identity)| -defined(A).
% 1.71/1.90 ** KEPT (pick-wt=8): 10 [] product(A,B,C)| -product(B,A,C).
% 1.71/1.90 ** KEPT (pick-wt=20): 11 [] sum(A,B,C)| -sum(D,E,F)| -product(F,G,C)| -product(D,G,A)| -product(E,G,B).
% 1.71/1.90 ** KEPT (pick-wt=20): 12 [] product(A,B,C)| -sum(D,E,A)| -product(D,B,F)| -product(E,B,G)| -sum(F,G,C).
% 1.71/1.90 ** KEPT (pick-wt=8): 13 [] defined(add(A,B))| -defined(A)| -defined(B).
% 1.71/1.90 ** KEPT (pick-wt=5): 14 [] defined(additive_inverse(A))| -defined(A).
% 1.71/1.90 ** KEPT (pick-wt=8): 15 [] defined(multiply(A,B))| -defined(A)| -defined(B).
% 1.92/2.10 ** KEPT (pick-wt=9): 16 [] defined(multiplicative_inverse(A))| -defined(A)|sum(additive_identity,A,additive_identity).
% 1.92/2.10 ** KEPT (pick-wt=10): 17 [] sum(A,B,add(A,B))| -defined(A)| -defined(B).
% 1.92/2.10 ** KEPT (pick-wt=10): 18 [] product(A,B,multiply(A,B))| -defined(A)| -defined(B).
% 1.92/2.10 ** KEPT (pick-wt=10): 19 [] sum(additive_identity,A,B)| -less_or_e_qual(A,B)| -less_or_e_qual(B,A).
% 1.92/2.10 ** KEPT (pick-wt=9): 20 [] less_or_e_qual(A,B)| -less_or_e_qual(A,C)| -less_or_e_qual(C,B).
% 1.92/2.10 ** KEPT (pick-wt=10): 21 [] less_or_e_qual(A,B)|less_or_e_qual(B,A)| -defined(A)| -defined(B).
% 1.92/2.10 ** KEPT (pick-wt=14): 22 [] less_or_e_qual(A,B)| -less_or_e_qual(C,D)| -sum(C,E,A)| -sum(D,E,B).
% 1.92/2.10 ** KEPT (pick-wt=13): 23 [] less_or_e_qual(additive_identity,A)| -less_or_e_qual(additive_identity,B)| -less_or_e_qual(additive_identity,C)| -product(B,C,A).
% 1.92/2.10 ** KEPT (pick-wt=4): 24 [] -sum(additive_identity,additive_identity,multiplicative_identity).
% 1.92/2.10 ** KEPT (pick-wt=4): 25 [] -product(d,b,c).
% 1.92/2.10
% 1.92/2.10 ------------> process sos:
% 1.92/2.10 ** KEPT (pick-wt=2): 49 [] defined(additive_identity).
% 1.92/2.10 ** KEPT (pick-wt=2): 50 [] defined(multiplicative_identity).
% 1.92/2.10 ** KEPT (pick-wt=2): 51 [] defined(a).
% 1.92/2.10 ** KEPT (pick-wt=2): 52 [] defined(b).
% 1.92/2.10 ** KEPT (pick-wt=2): 53 [] defined(c).
% 1.92/2.10 ** KEPT (pick-wt=2): 54 [] defined(d).
% 1.92/2.10 ** KEPT (pick-wt=4): 55 [] product(a,b,c).
% 1.92/2.10 ** KEPT (pick-wt=4): 56 [] product(multiplicative_identity,a,d).
% 1.92/2.10
% 1.92/2.10 ======= end of input processing =======
% 1.92/2.10
% 1.92/2.10 =========== start of search ===========
% 1.92/2.10
% 1.92/2.10
% 1.92/2.10 Resetting weight limit to 6.
% 1.92/2.10
% 1.92/2.10
% 1.92/2.10 Resetting weight limit to 6.
% 1.92/2.10
% 1.92/2.10 sos_size=9405
% 1.92/2.10
% 1.92/2.10 -------- PROOF --------
% 1.92/2.10
% 1.92/2.10 ----> UNIT CONFLICT at 0.19 sec ----> 9989 [binary,9988.1,25.1] $F.
% 1.92/2.10
% 1.92/2.10 Length of proof is 2. Level of proof is 2.
% 1.92/2.10
% 1.92/2.10 ---------------- PROOF ----------------
% 1.92/2.10 % SZS status Unsatisfiable
% 1.92/2.10 % SZS output start Refutation
% See solution above
% 1.92/2.10 ------------ end of proof -------------
% 1.92/2.10
% 1.92/2.10
% 1.92/2.10 Search stopped by max_proofs option.
% 1.92/2.10
% 1.92/2.10
% 1.92/2.10 Search stopped by max_proofs option.
% 1.92/2.10
% 1.92/2.10 ============ end of search ============
% 1.92/2.10
% 1.92/2.10 -------------- statistics -------------
% 1.92/2.10 clauses given 94
% 1.92/2.10 clauses generated 21283
% 1.92/2.10 clauses kept 9988
% 1.92/2.10 clauses forward subsumed 1696
% 1.92/2.10 clauses back subsumed 9
% 1.92/2.10 Kbytes malloced 4882
% 1.92/2.10
% 1.92/2.10 ----------- times (seconds) -----------
% 1.92/2.10 user CPU time 0.19 (0 hr, 0 min, 0 sec)
% 1.92/2.10 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.92/2.10 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.92/2.10
% 1.92/2.10 That finishes the proof of the theorem.
% 1.92/2.10
% 1.92/2.10 Process 1401 finished Wed Jul 27 03:10:54 2022
% 1.92/2.10 Otter interrupted
% 1.92/2.10 PROOF FOUND
%------------------------------------------------------------------------------