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