%------------------------------------------------------------------------------
% File : PyRes---1.5
% Problem : KRS003-1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% Computer : n026.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 : Thu May 9 17:28:26 EDT 2024
% Result : Unsatisfiable 0.41s 0.62s
% Output : Refutation 0.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 10
% Syntax : Number of clauses : 21 ( 11 unt; 0 nHn; 21 RR)
% Number of literals : 34 ( 0 equ; 15 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 11 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause_3,axiom,
( s2least(X2)
| ~ c(X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_3) ).
cnf(clause_1,negated_conjecture,
e(exist),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_1) ).
cnf(clause_15,axiom,
( c(X7)
| ~ e(X7) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_15) ).
cnf(c0,plain,
c(exist),
inference(resolution,[status(thm)],[clause_15,clause_1]) ).
cnf(c1,plain,
s2least(exist),
inference(resolution,[status(thm)],[c0,clause_3]) ).
cnf(clause_5,axiom,
( ~ s2least(X5)
| ~ equalish(u1r2(X5),u1r1(X5)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_5) ).
cnf(clause_9,axiom,
( s1most(X4)
| ~ d(X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_9) ).
cnf(clause_2,negated_conjecture,
f(exist),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_2) ).
cnf(clause_16,axiom,
( d(X9)
| ~ f(X9) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_16) ).
cnf(c4,plain,
d(exist),
inference(resolution,[status(thm)],[clause_16,clause_2]) ).
cnf(c5,plain,
s1most(exist),
inference(resolution,[status(thm)],[c4,clause_9]) ).
cnf(clause_7,axiom,
( s(X10,u1r2(X10))
| ~ s2least(X10) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_7) ).
cnf(c7,plain,
s(exist,u1r2(exist)),
inference(resolution,[status(thm)],[clause_7,c1]) ).
cnf(clause_6,axiom,
( s(X8,u1r1(X8))
| ~ s2least(X8) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_6) ).
cnf(c3,plain,
s(exist,u1r1(exist)),
inference(resolution,[status(thm)],[clause_6,c1]) ).
cnf(clause_11,axiom,
( equalish(X24,X23)
| ~ s1most(X25)
| ~ s(X25,X24)
| ~ s(X25,X23) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_11) ).
cnf(c27,plain,
( equalish(X73,u1r1(exist))
| ~ s1most(exist)
| ~ s(exist,X73) ),
inference(resolution,[status(thm)],[clause_11,c3]) ).
cnf(c130,plain,
( equalish(u1r2(exist),u1r1(exist))
| ~ s1most(exist) ),
inference(resolution,[status(thm)],[c27,c7]) ).
cnf(c165,plain,
equalish(u1r2(exist),u1r1(exist)),
inference(resolution,[status(thm)],[c130,c5]) ).
cnf(c166,plain,
~ s2least(exist),
inference(resolution,[status(thm)],[c165,clause_5]) ).
cnf(c167,plain,
$false,
inference(resolution,[status(thm)],[c166,c1]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.12 % Problem : KRS003-1 : TPTP v8.1.2. Released v2.0.0.
% 0.05/0.13 % Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.13/0.34 % Computer : n026.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 : Thu May 9 00:16:53 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.41/0.62 % Version: 1.5
% 0.41/0.62 % SZS status Unsatisfiable
% 0.41/0.62 % SZS output start CNFRefutation
% See solution above
% 0.41/0.62
% 0.41/0.62 % Initial clauses : 16
% 0.41/0.62 % Processed clauses : 58
% 0.41/0.62 % Factors computed : 2
% 0.41/0.62 % Resolvents computed: 168
% 0.41/0.62 % Tautologies deleted: 6
% 0.41/0.62 % Forward subsumed : 50
% 0.41/0.62 % Backward subsumed : 17
% 0.41/0.62 % -------- CPU Time ---------
% 0.41/0.62 % User time : 0.247 s
% 0.41/0.62 % System time : 0.020 s
% 0.41/0.62 % Total time : 0.267 s
%------------------------------------------------------------------------------