%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : KRS083+1 : TPTP v9.2.1. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n020.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 : Tue May 5 04:36:18 PM UTC 2026
% Result : Unsatisfiable 1.27s 1.69s
% Output : CNFRefutation 1.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 8
% Syntax : Number of formulae : 42 ( 5 unt; 0 def)
% Number of atoms : 141 ( 6 equ)
% Maximal formula atoms : 23 ( 3 avg)
% Number of connectives : 171 ( 72 ~; 61 |; 27 &)
% ( 6 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 78 ( 2 sgn 35 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_0,axiom,
! [X4] :
( cowlThing(X4)
& ~ cowlNothing(X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_0) ).
fof(axiom_4,axiom,
! [X4] :
( cowlThing(X4)
=> ! [X7,X8] :
( ( rf(X4,X7)
& rf(X4,X8) )
=> X7 = X8 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_4) ).
fof(axiom_3,axiom,
! [X4] :
( cd(X4)
<=> ( ? [X5] :
( rf(X4,X5)
& ~ cc(X5) )
& cc(X4) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).
fof(axiom_2,axiom,
! [X4] :
( cUnsatisfiable(X4)
<=> ( ! [X5] :
( rinvR(X4,X5)
=> ? [X6] :
( rinvF(X5,X6)
& cd(X6) ) )
& ~ cc(X4)
& ? [X5] :
( rinvF(X4,X5)
& cd(X5) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
fof(axiom_5,axiom,
! [X4,X5] :
( rinvF(X4,X5)
<=> rf(X5,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_5) ).
fof(axiom_6,axiom,
! [X4,X5] :
( rinvR(X4,X5)
<=> rr(X5,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_6) ).
fof(axiom_9,axiom,
! [X4,X5] :
( rf(X4,X5)
=> rr(X4,X5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_9) ).
fof(axiom_8,axiom,
cUnsatisfiable(i2003_11_14_17_19_32337),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_8) ).
fof(c_0_8,plain,
! [X4] :
( cowlThing(X4)
& ~ cowlNothing(X4) ),
inference(fof_simplification,[status(thm)],[axiom_0]) ).
fof(c_0_9,plain,
! [X119,X120,X121] :
( ~ cowlThing(X119)
| ~ rf(X119,X120)
| ~ rf(X119,X121)
| X120 = X121 ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_4])])]) ).
fof(c_0_10,plain,
! [X105] :
( cowlThing(X105)
& ~ cowlNothing(X105) ),
inference(variable_rename,[status(thm)],[c_0_8]) ).
fof(c_0_11,plain,
! [X4] :
( cd(X4)
<=> ( ? [X5] :
( rf(X4,X5)
& ~ cc(X5) )
& cc(X4) ) ),
inference(fof_simplification,[status(thm)],[axiom_3]) ).
fof(c_0_12,plain,
! [X4] :
( cUnsatisfiable(X4)
<=> ( ! [X5] :
( rinvR(X4,X5)
=> ? [X6] :
( rinvF(X5,X6)
& cd(X6) ) )
& ~ cc(X4)
& ? [X5] :
( rinvF(X4,X5)
& cd(X5) ) ) ),
inference(fof_simplification,[status(thm)],[axiom_2]) ).
cnf(c_0_13,plain,
( X2 = X3
| ~ cowlThing(X1)
| ~ rf(X1,X2)
| ~ rf(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
cowlThing(X1),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_15,plain,
! [X115,X117,X118] :
( ( rf(X115,esk4_1(X115))
| ~ cd(X115) )
& ( ~ cc(esk4_1(X115))
| ~ cd(X115) )
& ( cc(X115)
| ~ cd(X115) )
& ( ~ rf(X117,X118)
| cc(X118)
| ~ cc(X117)
| cd(X117) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])])])]) ).
fof(c_0_16,plain,
! [X122,X123] :
( ( ~ rinvF(X122,X123)
| rf(X123,X122) )
& ( ~ rf(X123,X122)
| rinvF(X122,X123) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_5])]) ).
fof(c_0_17,plain,
! [X107,X108,X111,X113,X114] :
( ( rinvF(X108,esk1_2(X107,X108))
| ~ rinvR(X107,X108)
| ~ cUnsatisfiable(X107) )
& ( cd(esk1_2(X107,X108))
| ~ rinvR(X107,X108)
| ~ cUnsatisfiable(X107) )
& ( ~ cc(X107)
| ~ cUnsatisfiable(X107) )
& ( rinvF(X107,esk2_1(X107))
| ~ cUnsatisfiable(X107) )
& ( cd(esk2_1(X107))
| ~ cUnsatisfiable(X107) )
& ( rinvR(X111,esk3_1(X111))
| cc(X111)
| ~ rinvF(X111,X114)
| ~ cd(X114)
| cUnsatisfiable(X111) )
& ( ~ rinvF(esk3_1(X111),X113)
| ~ cd(X113)
| cc(X111)
| ~ rinvF(X111,X114)
| ~ cd(X114)
| cUnsatisfiable(X111) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])])])]) ).
cnf(c_0_18,plain,
( X2 = X3
| ~ rf(X1,X3)
| ~ rf(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14])]) ).
cnf(c_0_19,plain,
( rf(X1,esk4_1(X1))
| ~ cd(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,plain,
( rf(X2,X1)
| ~ rinvF(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,plain,
( rinvF(X1,esk1_2(X2,X1))
| ~ rinvR(X2,X1)
| ~ cUnsatisfiable(X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_22,plain,
( X1 = esk4_1(X2)
| ~ rf(X2,X1)
| ~ cd(X2) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,plain,
( rf(esk1_2(X1,X2),X2)
| ~ rinvR(X1,X2)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,plain,
( cd(esk1_2(X1,X2))
| ~ rinvR(X1,X2)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,plain,
( ~ cc(esk4_1(X1))
| ~ cd(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_26,plain,
( esk4_1(esk1_2(X1,X2)) = X2
| ~ rinvR(X1,X2)
| ~ cUnsatisfiable(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).
fof(c_0_27,plain,
! [X124,X125] :
( ( ~ rinvR(X124,X125)
| rr(X125,X124) )
& ( ~ rr(X125,X124)
| rinvR(X124,X125) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_6])]) ).
cnf(c_0_28,plain,
( ~ rinvR(X1,X2)
| ~ cc(X2)
| ~ cUnsatisfiable(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_24]) ).
cnf(c_0_29,plain,
( rinvR(X2,X1)
| ~ rr(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
fof(c_0_30,plain,
! [X129,X130] :
( ~ rf(X129,X130)
| rr(X129,X130) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_9])]) ).
cnf(c_0_31,plain,
( ~ rr(X1,X2)
| ~ cc(X1)
| ~ cUnsatisfiable(X2) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,plain,
( rr(X1,X2)
| ~ rf(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_33,plain,
( rinvF(X1,esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_34,plain,
( ~ rf(X1,X2)
| ~ cc(X1)
| ~ cUnsatisfiable(X2) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_35,plain,
( rf(esk2_1(X1),X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_33]) ).
cnf(c_0_36,plain,
( ~ cc(esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_37,plain,
( cc(X1)
| ~ cd(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_38,plain,
( cd(esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_39,plain,
cUnsatisfiable(i2003_11_14_17_19_32337),
inference(split_conjunct,[status(thm)],[axiom_8]) ).
cnf(c_0_40,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]) ).
cnf(c_0_41,plain,
$false,
inference(sr,[status(thm)],[c_0_39,c_0_40]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : KRS083+1 : TPTP v9.2.1. Released v3.1.0.
% 0.00/0.09 % Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.11/0.30 % Computer : n020.cluster.edu
% 0.11/0.30 % Model : x86_64 x86_64
% 0.11/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.30 % Memory : 8042.1875MB
% 0.11/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.30 % CPULimit : 300
% 0.11/0.30 % WCLimit : 300
% 0.11/0.30 % DateTime : Mon May 4 20:37:19 EDT 2026
% 0.11/0.30 % CPUTime :
% 0.11/0.31 % start to proof: theBenchmark
% 1.27/1.69 % Version : CSE_E---1.7
% 1.27/1.69 % Problem : theBenchmark.p
% 1.27/1.69 % SZS status Unsatisfiable for theBenchmark.p
% 1.27/1.69 % SZS output start CNFRefutation
% See solution above
% 1.27/1.69 % Total time : 1.372s
%------------------------------------------------------------------------------