%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : KRS267+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n011.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 : Sun Sep 27 07:46:23 AM UTC 2026
% Result : Theorem 0.99s 0.70s
% Output : CNFRefutation 0.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 28 ( 12 unt; 0 def)
% Number of atoms : 75 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 80 ( 33 ~; 28 |; 14 &)
% ( 4 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 68 ( 4 sgn 42 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(thm,axiom,
! [Ax,C] :
( ! [I1] :
( model(I1,Ax)
=> model(I1,C) )
<=> status(Ax,C,thm) ),
file('theBenchmark.p',thm) ).
fof(tca,axiom,
! [Ax,C] :
( ( ! [I2] : model(I2,C)
& ~ ? [I1] : model(I1,Ax) )
<=> status(Ax,C,tca) ),
file('theBenchmark.p',tca) ).
fof(mighta,axiom,
! [S1,S2] :
( ? [Ax,C] :
( status(Ax,C,S2)
& status(Ax,C,S1) )
<=> mighta(S1,S2) ),
file('theBenchmark.p',mighta) ).
fof(not,axiom,
! [I,F] :
( model(I,F)
<=> ~ model(I,not(F)) ),
file('theBenchmark.p',not) ).
fof(tautology,axiom,
? [F] :
! [I] : model(I,F),
file('theBenchmark.p',tautology) ).
fof(mighta_tca_thm,conjecture,
mighta(tca,thm),
file('theBenchmark.p',mighta_tca_thm) ).
fof(mighta_tca_thm_neg,negated_conjecture,
~ mighta(tca,thm),
inference(assume_negation,[status(cth)],[mighta_tca_thm]) ).
cnf(c_35,plain,
( mighta(C,D)
| ~ status(A,B,D)
| ~ status(A,B,C) ),
inference(clausify,[status(thm)],[mighta]) ).
cnf(c_37,negated_conjecture,
~ mighta(tca,thm),
inference(clausify,[status(thm)],[mighta_tca_thm_neg]) ).
cnf(c_57,negated_conjecture,
( ~ status(A,B,thm)
| ~ status(A,B,tca) ),
inference(resolve,[status(thm)],[c_37,c_35]) ).
fof(nnf_27,plain,
? [F] :
! [I] : model(I,F),
inference(fof_nnf,[status(thm)],[tautology]) ).
fof(sk_tautology,plain,
! [I] : model(I,sK0),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(F,sK0)],[nnf_27]) ).
cnf(c_74,plain,
model(A,sK0),
inference(split_conjunct,[status(thm)],[sk_tautology]) ).
cnf(c_76,plain,
( ~ model(A,not(B))
| ~ model(A,B) ),
inference(clausify,[status(thm)],[not]) ).
fof(nnf_15,plain,
! [Ax,C] :
( ( ~ status(Ax,C,tca)
| ( ! [I2] : model(I2,C)
& ! [I1] : ~ model(I1,Ax) ) )
& ( status(Ax,C,tca)
| ? [X0] : ~ model(X0,C)
| ? [X1] : model(X1,Ax) ) ),
inference(fof_nnf,[status(thm)],[tca]) ).
fof(sk_tca_sk,plain,
! [Ax,C] :
( ( ~ status(Ax,C,tca)
| ( ! [I2] : model(I2,C)
& ! [I1] : ~ model(I1,Ax) ) )
& ( status(Ax,C,tca)
| ~ model(sK2(Ax,C),C)
| model(sK1(Ax,C),Ax) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2]),skolemize(X1,sK1(Ax,C)),skolemize(X0,sK2(Ax,C))],[nnf_15]) ).
fof(sk_tca,plain,
( ! [VAR_0,VAR_1,VAR_2] :
( ~ status(VAR_2,VAR_1,tca)
| model(VAR_0,VAR_1) )
& ! [VAR_0,VAR_1,VAR_2] :
( ~ status(VAR_1,VAR_2,tca)
| ~ model(VAR_0,VAR_1) )
& ! [VAR_0,VAR_1] :
( status(VAR_0,VAR_1,tca)
| ~ model(sK2(VAR_0,VAR_1),VAR_1)
| model(sK1(VAR_0,VAR_1),VAR_0) ) ),
inference(cnf_transformation,[status(thm)],[sk_tca_sk]) ).
cnf(c_94,plain,
( status(A,B,tca)
| ~ model(sK2(A,B),B)
| model(sK1(A,B),A) ),
inference(split_conjunct,[status(thm)],[sk_tca]) ).
fof(nnf_5,plain,
! [Ax,C] :
( ( ~ status(Ax,C,thm)
| ! [I1] :
( model(I1,C)
| ~ model(I1,Ax) ) )
& ( status(Ax,C,thm)
| ? [X0] :
( ~ model(X0,C)
& model(X0,Ax) ) ) ),
inference(fof_nnf,[status(thm)],[thm]) ).
fof(sk_thm_sk,plain,
! [Ax,C] :
( ( ~ status(Ax,C,thm)
| ! [I1] :
( model(I1,C)
| ~ model(I1,Ax) ) )
& ( status(Ax,C,thm)
| ( ~ model(sK3(Ax,C),C)
& model(sK3(Ax,C),Ax) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(X0,sK3(Ax,C))],[nnf_5]) ).
fof(sk_thm,plain,
( ! [VAR_0,VAR_1,VAR_2] :
( ~ status(VAR_1,VAR_2,thm)
| model(VAR_0,VAR_2)
| ~ model(VAR_0,VAR_1) )
& ! [VAR_0,VAR_1] :
( status(VAR_0,VAR_1,thm)
| ~ model(sK3(VAR_0,VAR_1),VAR_1) )
& ! [VAR_0,VAR_1] :
( status(VAR_0,VAR_1,thm)
| model(sK3(VAR_0,VAR_1),VAR_0) ) ),
inference(cnf_transformation,[status(thm)],[sk_thm_sk]) ).
cnf(c_135,plain,
( status(A,B,thm)
| ~ model(sK3(A,B),B) ),
inference(split_conjunct,[status(thm)],[sk_thm]) ).
cnf(c_174,plain,
~ model(A,not(sK0)),
inference(resolve,[status(thm)],[c_76,c_74]) ).
cnf(c_259,plain,
( status(A,sK0,tca)
| model(sK1(A,sK0),A) ),
inference(resolve,[status(thm)],[c_94,c_74]) ).
cnf(c_517,plain,
status(A,sK0,thm),
inference(resolve,[status(thm)],[c_135,c_74]) ).
cnf(c_803,plain,
~ status(A,sK0,tca),
inference(resolve,[status(thm)],[c_517,c_57]) ).
cnf(c_810,plain,
model(sK1(A,sK0),A),
inference(resolve,[status(thm)],[c_803,c_259]) ).
cnf(c_811,plain,
$false,
inference(resolve,[status(thm)],[c_810,c_174]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : KRS267+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% 0.00/0.06 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.41 % Computer : n011.cluster.edu
% 0.09/0.41 % Model : x86_64 x86_64
% 0.09/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.41 % Memory : 8046.5625MB
% 0.09/0.41 % OS : Linux 6.8.0-71-generic
% 0.09/0.41 % CPULimit : 300
% 0.09/0.41 % WCLimit : 300
% 0.09/0.41 % DateTime : Fri Sep 25 19:50:59 UTC 2026
% 0.09/0.41 % CPUTime :
% 0.09/0.41 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.41 % Process 2731674 was started by sandbox on n011,
% 0.09/0.41 % Fri Sep 25 19:50:59 2026
% 0.09/0.41 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.09/0.42
% 0.09/0.42 % From the command line: assign(max_seconds, 300).
% 0.99/0.70
% 0.99/0.70 % SZS status Theorem for theBenchmark
% 0.99/0.70
% 0.99/0.70 % Proof 1 at 0.08 (+ 0.02) seconds.
% 0.99/0.70 % Length of proof is 19.
% 0.99/0.70 % Level of proof is 5.
% 0.99/0.70 % Maximum clause weight is 24.000.
% 0.99/0.70 % Given clauses 126.
% 0.99/0.70
% 0.99/0.70 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------