%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : FLD030-1 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n023.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:45 EDT 2022
% Result : Unsatisfiable 2.07s 2.25s
% Output : Refutation 2.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 5
% Syntax : Number of clauses : 8 ( 6 unt; 0 nHn; 8 RR)
% Number of literals : 11 ( 0 equ; 4 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 5 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(20,axiom,
( e_qualish(A,B)
| ~ e_qualish(B,A) ),
file('FLD030-1.p',unknown),
[] ).
cnf(23,axiom,
( e_qualish(multiply(A,B),multiply(C,B))
| ~ defined(B)
| ~ e_qualish(A,C) ),
file('FLD030-1.p',unknown),
[] ).
cnf(26,axiom,
~ e_qualish(multiply(d,b),multiply(a,b)),
file('FLD030-1.p',unknown),
[] ).
cnf(49,axiom,
defined(b),
file('FLD030-1.p',unknown),
[] ).
cnf(51,axiom,
e_qualish(a,d),
file('FLD030-1.p',unknown),
[] ).
cnf(585,plain,
e_qualish(d,a),
inference(hyper,[status(thm)],[51,20]),
[iquote('hyper,51,20')] ).
cnf(3808,plain,
e_qualish(multiply(d,b),multiply(a,b)),
inference(hyper,[status(thm)],[585,23,49]),
[iquote('hyper,585,23,49')] ).
cnf(3809,plain,
$false,
inference(binary,[status(thm)],[3808,26]),
[iquote('binary,3808.1,26.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : FLD030-1 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.03/0.13 % Command : otter-tptp-script %s
% 0.13/0.34 % Computer : n023.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Wed Jul 27 03:40:18 EDT 2022
% 0.13/0.34 % CPUTime :
% 2.01/2.18 ----- Otter 3.3f, August 2004 -----
% 2.01/2.18 The process was started by sandbox2 on n023.cluster.edu,
% 2.01/2.18 Wed Jul 27 03:40:18 2022
% 2.01/2.18 The command was "./otter". The process ID is 2527.
% 2.01/2.18
% 2.01/2.18 set(prolog_style_variables).
% 2.01/2.18 set(auto).
% 2.01/2.18 dependent: set(auto1).
% 2.01/2.18 dependent: set(process_input).
% 2.01/2.18 dependent: clear(print_kept).
% 2.01/2.18 dependent: clear(print_new_demod).
% 2.01/2.18 dependent: clear(print_back_demod).
% 2.01/2.18 dependent: clear(print_back_sub).
% 2.01/2.18 dependent: set(control_memory).
% 2.01/2.18 dependent: assign(max_mem, 12000).
% 2.01/2.18 dependent: assign(pick_given_ratio, 4).
% 2.01/2.18 dependent: assign(stats_level, 1).
% 2.01/2.18 dependent: assign(max_seconds, 10800).
% 2.01/2.18 clear(print_given).
% 2.01/2.18
% 2.01/2.18 list(usable).
% 2.01/2.18 0 [] e_qualish(add(X,add(Y,Z)),add(add(X,Y),Z))| -defined(X)| -defined(Y)| -defined(Z).
% 2.01/2.18 0 [] e_qualish(add(additive_identity,X),X)| -defined(X).
% 2.01/2.18 0 [] e_qualish(add(X,additive_inverse(X)),additive_identity)| -defined(X).
% 2.01/2.18 0 [] e_qualish(add(X,Y),add(Y,X))| -defined(X)| -defined(Y).
% 2.01/2.18 0 [] e_qualish(multiply(X,multiply(Y,Z)),multiply(multiply(X,Y),Z))| -defined(X)| -defined(Y)| -defined(Z).
% 2.01/2.18 0 [] e_qualish(multiply(multiplicative_identity,X),X)| -defined(X).
% 2.01/2.18 0 [] e_qualish(multiply(X,multiplicative_inverse(X)),multiplicative_identity)| -defined(X)|e_qualish(X,additive_identity).
% 2.01/2.18 0 [] e_qualish(multiply(X,Y),multiply(Y,X))| -defined(X)| -defined(Y).
% 2.01/2.18 0 [] e_qualish(add(multiply(X,Z),multiply(Y,Z)),multiply(add(X,Y),Z))| -defined(X)| -defined(Y)| -defined(Z).
% 2.01/2.18 0 [] defined(add(X,Y))| -defined(X)| -defined(Y).
% 2.01/2.18 0 [] defined(additive_identity).
% 2.01/2.18 0 [] defined(additive_inverse(X))| -defined(X).
% 2.01/2.18 0 [] defined(multiply(X,Y))| -defined(X)| -defined(Y).
% 2.01/2.18 0 [] defined(multiplicative_identity).
% 2.01/2.18 0 [] defined(multiplicative_inverse(X))| -defined(X)|e_qualish(X,additive_identity).
% 2.01/2.18 0 [] e_qualish(X,Y)| -less_or_e_qual(X,Y)| -less_or_e_qual(Y,X).
% 2.01/2.18 0 [] less_or_e_qual(X,Z)| -less_or_e_qual(X,Y)| -less_or_e_qual(Y,Z).
% 2.01/2.18 0 [] less_or_e_qual(X,Y)|less_or_e_qual(Y,X)| -defined(X)| -defined(Y).
% 2.01/2.18 0 [] less_or_e_qual(add(X,Z),add(Y,Z))| -defined(Z)| -less_or_e_qual(X,Y).
% 2.01/2.18 0 [] less_or_e_qual(additive_identity,multiply(Y,Z))| -less_or_e_qual(additive_identity,Y)| -less_or_e_qual(additive_identity,Z).
% 2.01/2.18 0 [] e_qualish(X,X)| -defined(X).
% 2.01/2.18 0 [] e_qualish(X,Y)| -e_qualish(Y,X).
% 2.01/2.18 0 [] e_qualish(X,Z)| -e_qualish(X,Y)| -e_qualish(Y,Z).
% 2.01/2.18 0 [] e_qualish(add(X,Z),add(Y,Z))| -defined(Z)| -e_qualish(X,Y).
% 2.01/2.18 0 [] e_qualish(multiply(X,Z),multiply(Y,Z))| -defined(Z)| -e_qualish(X,Y).
% 2.01/2.18 0 [] less_or_e_qual(Y,Z)| -less_or_e_qual(X,Z)| -e_qualish(X,Y).
% 2.01/2.18 0 [] -e_qualish(additive_identity,multiplicative_identity).
% 2.01/2.18 0 [] defined(a).
% 2.01/2.18 0 [] defined(b).
% 2.01/2.18 0 [] defined(d).
% 2.01/2.18 0 [] e_qualish(a,d).
% 2.01/2.18 0 [] -e_qualish(multiply(d,b),multiply(a,b)).
% 2.01/2.18 end_of_list.
% 2.01/2.18
% 2.01/2.18 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=4.
% 2.01/2.18
% 2.01/2.18 This is a non-Horn set without equality. The strategy will
% 2.01/2.18 be ordered hyper_res, unit deletion, and factoring, with
% 2.01/2.18 satellites in sos and with nuclei in usable.
% 2.01/2.18
% 2.01/2.18 dependent: set(hyper_res).
% 2.01/2.18 dependent: set(factor).
% 2.01/2.18 dependent: set(unit_deletion).
% 2.01/2.18
% 2.01/2.18 ------------> process usable:
% 2.01/2.18 ** KEPT (pick-wt=17): 1 [] e_qualish(add(A,add(B,C)),add(add(A,B),C))| -defined(A)| -defined(B)| -defined(C).
% 2.01/2.18 ** KEPT (pick-wt=7): 2 [] e_qualish(add(additive_identity,A),A)| -defined(A).
% 2.01/2.18 ** KEPT (pick-wt=8): 3 [] e_qualish(add(A,additive_inverse(A)),additive_identity)| -defined(A).
% 2.01/2.18 ** KEPT (pick-wt=11): 4 [] e_qualish(add(A,B),add(B,A))| -defined(A)| -defined(B).
% 2.01/2.18 ** KEPT (pick-wt=17): 5 [] e_qualish(multiply(A,multiply(B,C)),multiply(multiply(A,B),C))| -defined(A)| -defined(B)| -defined(C).
% 2.01/2.18 ** KEPT (pick-wt=7): 6 [] e_qualish(multiply(multiplicative_identity,A),A)| -defined(A).
% 2.01/2.18 ** KEPT (pick-wt=11): 7 [] e_qualish(multiply(A,multiplicative_inverse(A)),multiplicative_identity)| -defined(A)|e_qualish(A,additive_identity).
% 2.01/2.18 ** KEPT (pick-wt=11): 8 [] e_qualish(multiply(A,B),multiply(B,A))| -defined(A)| -defined(B).
% 2.01/2.18 ** KEPT (pick-wt=19): 9 [] e_qualish(add(multiply(A,B),multiply(C,B)),multiply(add(A,C),B))| -defined(A)| -defined(C)| -defined(B).
% 2.01/2.18 ** KEPT (pick-wt=8): 10 [] defined(add(A,B))| -defined(A)| -defined(B).
% 2.01/2.18 ** KEPT (pick-wt=5): 11 [] defined(additive_inverse(A))| -defined(A).
% 2.07/2.25 ** KEPT (pick-wt=8): 12 [] defined(multiply(A,B))| -defined(A)| -defined(B).
% 2.07/2.25 ** KEPT (pick-wt=8): 13 [] defined(multiplicative_inverse(A))| -defined(A)|e_qualish(A,additive_identity).
% 2.07/2.25 ** KEPT (pick-wt=9): 14 [] e_qualish(A,B)| -less_or_e_qual(A,B)| -less_or_e_qual(B,A).
% 2.07/2.25 ** KEPT (pick-wt=9): 15 [] less_or_e_qual(A,B)| -less_or_e_qual(A,C)| -less_or_e_qual(C,B).
% 2.07/2.25 ** KEPT (pick-wt=10): 16 [] less_or_e_qual(A,B)|less_or_e_qual(B,A)| -defined(A)| -defined(B).
% 2.07/2.25 ** KEPT (pick-wt=12): 17 [] less_or_e_qual(add(A,B),add(C,B))| -defined(B)| -less_or_e_qual(A,C).
% 2.07/2.25 ** KEPT (pick-wt=11): 18 [] less_or_e_qual(additive_identity,multiply(A,B))| -less_or_e_qual(additive_identity,A)| -less_or_e_qual(additive_identity,B).
% 2.07/2.25 ** KEPT (pick-wt=5): 19 [] e_qualish(A,A)| -defined(A).
% 2.07/2.25 ** KEPT (pick-wt=6): 20 [] e_qualish(A,B)| -e_qualish(B,A).
% 2.07/2.25 ** KEPT (pick-wt=9): 21 [] e_qualish(A,B)| -e_qualish(A,C)| -e_qualish(C,B).
% 2.07/2.25 ** KEPT (pick-wt=12): 22 [] e_qualish(add(A,B),add(C,B))| -defined(B)| -e_qualish(A,C).
% 2.07/2.25 ** KEPT (pick-wt=12): 23 [] e_qualish(multiply(A,B),multiply(C,B))| -defined(B)| -e_qualish(A,C).
% 2.07/2.25 ** KEPT (pick-wt=9): 24 [] less_or_e_qual(A,B)| -less_or_e_qual(C,B)| -e_qualish(C,A).
% 2.07/2.25 ** KEPT (pick-wt=3): 25 [] -e_qualish(additive_identity,multiplicative_identity).
% 2.07/2.25 ** KEPT (pick-wt=7): 26 [] -e_qualish(multiply(d,b),multiply(a,b)).
% 2.07/2.25
% 2.07/2.25 ------------> process sos:
% 2.07/2.25 ** KEPT (pick-wt=2): 46 [] defined(additive_identity).
% 2.07/2.25 ** KEPT (pick-wt=2): 47 [] defined(multiplicative_identity).
% 2.07/2.25 ** KEPT (pick-wt=2): 48 [] defined(a).
% 2.07/2.25 ** KEPT (pick-wt=2): 49 [] defined(b).
% 2.07/2.25 ** KEPT (pick-wt=2): 50 [] defined(d).
% 2.07/2.25 ** KEPT (pick-wt=3): 51 [] e_qualish(a,d).
% 2.07/2.25
% 2.07/2.25 ======= end of input processing =======
% 2.07/2.25
% 2.07/2.25 =========== start of search ===========
% 2.07/2.25
% 2.07/2.25 -------- PROOF --------
% 2.07/2.25
% 2.07/2.25 ----> UNIT CONFLICT at 0.07 sec ----> 3809 [binary,3808.1,26.1] $F.
% 2.07/2.25
% 2.07/2.25 Length of proof is 2. Level of proof is 2.
% 2.07/2.25
% 2.07/2.25 ---------------- PROOF ----------------
% 2.07/2.25 % SZS status Unsatisfiable
% 2.07/2.25 % SZS output start Refutation
% See solution above
% 2.07/2.25 ------------ end of proof -------------
% 2.07/2.25
% 2.07/2.25
% 2.07/2.25 Search stopped by max_proofs option.
% 2.07/2.25
% 2.07/2.25
% 2.07/2.25 Search stopped by max_proofs option.
% 2.07/2.25
% 2.07/2.25 ============ end of search ============
% 2.07/2.25
% 2.07/2.25 -------------- statistics -------------
% 2.07/2.25 clauses given 25
% 2.07/2.25 clauses generated 5476
% 2.07/2.25 clauses kept 3808
% 2.07/2.25 clauses forward subsumed 1698
% 2.07/2.25 clauses back subsumed 1
% 2.07/2.25 Kbytes malloced 2929
% 2.07/2.25
% 2.07/2.25 ----------- times (seconds) -----------
% 2.07/2.25 user CPU time 0.07 (0 hr, 0 min, 0 sec)
% 2.07/2.25 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.07/2.25 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.07/2.25
% 2.07/2.25 That finishes the proof of the theorem.
% 2.07/2.25
% 2.07/2.25 Process 2527 finished Wed Jul 27 03:40:20 2022
% 2.07/2.25 Otter interrupted
% 2.07/2.25 PROOF FOUND
%------------------------------------------------------------------------------