%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : GRP147-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n004.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri Sep 25 01:25:26 PM UTC 2026
% Result : Unsatisfiable 6.02s 1.23s
% Output : CNFRefutation 6.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 9
% Syntax : Number of clauses : 47 ( 47 unt; 0 nHn; 37 RR)
% Number of literals : 47 ( 46 equ; 23 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 22 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(t8,axiom,
least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
cnf(t72,plain,
least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
inference(orient,[status(thm)],[t8]) ).
cnf(t17,axiom,
sFlat0 = least_upper_bound(a,b),
introduced(definition) ).
cnf(t97,plain,
sFlat0 = least_upper_bound(b,a),
inference(step,[status(thm)],[t17,t72]) ).
cnf(t87,plain,
least_upper_bound(b,a) = sFlat0,
inference(orient,[status(thm)],[t97]) ).
cnf(t1,axiom,
greatest_lower_bound(a,c) = a,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
cnf(t6,axiom,
greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
cnf(t49,plain,
greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
inference(orient,[status(thm)],[t6]) ).
cnf(t95,plain,
greatest_lower_bound(c,a) = a,
inference(step,[status(thm)],[t1,t49]) ).
cnf(t66,plain,
greatest_lower_bound(c,a) = a,
inference(orient,[status(thm)],[t95]) ).
cnf(t9,axiom,
least_upper_bound(X1,greatest_lower_bound(X1,X2)) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
cnf(t23,plain,
least_upper_bound(X1,greatest_lower_bound(X1,X2)) = X1,
inference(orient,[status(thm)],[t9]) ).
cnf(t68,plain,
c = least_upper_bound(c,a),
inference(cp,[status(thm)],[t23,t66]) ).
cnf(t90,plain,
least_upper_bound(c,a) = c,
inference(orient,[status(thm)],[t68]) ).
cnf(t2,axiom,
greatest_lower_bound(b,c) = b,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
cnf(t96,plain,
greatest_lower_bound(c,b) = b,
inference(step,[status(thm)],[t2,t49]) ).
cnf(t69,plain,
greatest_lower_bound(c,b) = b,
inference(orient,[status(thm)],[t96]) ).
cnf(t71,plain,
c = least_upper_bound(c,b),
inference(cp,[status(thm)],[t23,t69]) ).
cnf(t92,plain,
least_upper_bound(c,b) = c,
inference(orient,[status(thm)],[t71]) ).
cnf(t11,axiom,
least_upper_bound(least_upper_bound(X1,X2),X3) = least_upper_bound(X1,least_upper_bound(X2,X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
cnf(t77,plain,
least_upper_bound(least_upper_bound(X1,X2),X3) = least_upper_bound(X1,least_upper_bound(X2,X3)),
inference(orient,[status(thm)],[t11]) ).
cnf(t7,axiom,
greatest_lower_bound(X1,least_upper_bound(X1,X2)) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
cnf(t21,plain,
greatest_lower_bound(X1,least_upper_bound(X1,X2)) = X1,
inference(orient,[status(thm)],[t7]) ).
cnf(goal_0,negated_conjecture,
greatest_lower_bound(least_upper_bound(a,b),c) != least_upper_bound(a,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
cnf(g0_0,plain,
greatest_lower_bound(least_upper_bound(a,b),c) != least_upper_bound(b,a),
inference(rw,[status(thm)],[goal_0,t72]) ).
cnf(g0_1,plain,
greatest_lower_bound(least_upper_bound(a,b),c) != sFlat0,
inference(rw,[status(thm)],[g0_0,t87]) ).
cnf(g0_2,plain,
greatest_lower_bound(least_upper_bound(greatest_lower_bound(c,a),b),c) != sFlat0,
inference(rw,[status(thm)],[g0_1,t66]) ).
cnf(g0_3,plain,
greatest_lower_bound(least_upper_bound(greatest_lower_bound(a,c),b),c) != sFlat0,
inference(rw,[status(thm)],[g0_2,t49]) ).
cnf(g0_4,plain,
greatest_lower_bound(least_upper_bound(greatest_lower_bound(a,c),b),least_upper_bound(c,a)) != sFlat0,
inference(rw,[status(thm)],[g0_3,t90]) ).
cnf(g0_5,plain,
greatest_lower_bound(least_upper_bound(greatest_lower_bound(a,c),b),least_upper_bound(a,c)) != sFlat0,
inference(rw,[status(thm)],[g0_4,t72]) ).
cnf(g0_6,plain,
greatest_lower_bound(least_upper_bound(greatest_lower_bound(a,c),b),least_upper_bound(a,least_upper_bound(c,b))) != sFlat0,
inference(rw,[status(thm)],[g0_5,t92]) ).
cnf(g0_7,plain,
greatest_lower_bound(least_upper_bound(greatest_lower_bound(a,c),b),least_upper_bound(a,least_upper_bound(b,c))) != sFlat0,
inference(rw,[status(thm)],[g0_6,t72]) ).
cnf(g0_8,plain,
greatest_lower_bound(least_upper_bound(greatest_lower_bound(a,c),b),least_upper_bound(least_upper_bound(b,c),a)) != sFlat0,
inference(rw,[status(thm)],[g0_7,t72]) ).
cnf(g0_9,plain,
greatest_lower_bound(least_upper_bound(greatest_lower_bound(c,a),b),least_upper_bound(least_upper_bound(b,c),a)) != sFlat0,
inference(rw,[status(thm)],[g0_8,t49]) ).
cnf(g0_10,plain,
greatest_lower_bound(least_upper_bound(b,greatest_lower_bound(c,a)),least_upper_bound(least_upper_bound(b,c),a)) != sFlat0,
inference(rw,[status(thm)],[g0_9,t72]) ).
cnf(g0_11,plain,
greatest_lower_bound(least_upper_bound(b,greatest_lower_bound(c,a)),least_upper_bound(b,least_upper_bound(c,a))) != sFlat0,
inference(rw,[status(thm)],[g0_10,t77]) ).
cnf(g0_12,plain,
greatest_lower_bound(least_upper_bound(b,greatest_lower_bound(c,a)),least_upper_bound(least_upper_bound(c,a),b)) != sFlat0,
inference(rw,[status(thm)],[g0_11,t72]) ).
cnf(g0_13,plain,
greatest_lower_bound(least_upper_bound(b,greatest_lower_bound(c,a)),least_upper_bound(c,least_upper_bound(a,b))) != sFlat0,
inference(rw,[status(thm)],[g0_12,t77]) ).
cnf(g0_14,plain,
greatest_lower_bound(least_upper_bound(b,greatest_lower_bound(c,a)),least_upper_bound(c,least_upper_bound(b,a))) != sFlat0,
inference(rw,[status(thm)],[g0_13,t72]) ).
cnf(g0_15,plain,
greatest_lower_bound(least_upper_bound(c,least_upper_bound(b,a)),least_upper_bound(b,greatest_lower_bound(c,a))) != sFlat0,
inference(rw,[status(thm)],[g0_14,t49]) ).
cnf(g0_16,plain,
greatest_lower_bound(least_upper_bound(c,least_upper_bound(b,a)),least_upper_bound(b,a)) != sFlat0,
inference(rw,[status(thm)],[g0_15,t66]) ).
cnf(g0_17,plain,
greatest_lower_bound(least_upper_bound(c,least_upper_bound(b,a)),sFlat0) != sFlat0,
inference(rw,[status(thm)],[g0_16,t87]) ).
cnf(g0_18,plain,
greatest_lower_bound(sFlat0,least_upper_bound(c,least_upper_bound(b,a))) != sFlat0,
inference(rw,[status(thm)],[g0_17,t49]) ).
cnf(g0_19,plain,
greatest_lower_bound(sFlat0,least_upper_bound(c,sFlat0)) != sFlat0,
inference(rw,[status(thm)],[g0_18,t87]) ).
cnf(g0_20,plain,
greatest_lower_bound(sFlat0,least_upper_bound(sFlat0,c)) != sFlat0,
inference(rw,[status(thm)],[g0_19,t72]) ).
cnf(g0_21,plain,
sFlat0 != sFlat0,
inference(rw,[status(thm)],[g0_20,t21]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_21]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP147-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.03 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.10/0.36 % Computer : n004.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Wed Sep 23 13:51:52 UTC 2026
% 0.14/0.36 % CPUTime :
% 0.14/0.36 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 6.02/1.23 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.02/1.23 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------