%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SYN210-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n017.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 09:37:18 AM UTC 2026
% Result : Unsatisfiable 0.93s 0.50s
% Output : CNFRefutation 0.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of formulae : 21 ( 9 unt; 0 def)
% Number of atoms : 35 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 32 ( 18 ~; 14 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 32 ( 12 sgn 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_26,axiom,
n0(d,c),
file('theBenchmark.p',axiom_26) ).
cnf(c_5,plain,
n0(d,c),
inference(clausify,[status(thm)],[axiom_26]) ).
fof(rule_002,axiom,
! [VAR_0,VAR_1] :
( ~ n0(VAR_1,VAR_0)
| l1(VAR_0,VAR_0) ),
file('theBenchmark.p',rule_002) ).
cnf(c_10,plain,
( ~ n0(B,A)
| l1(A,A) ),
inference(clausify,[status(thm)],[rule_002]) ).
fof(rule_066,axiom,
! [VAR_0,VAR_1] :
( ~ n0(VAR_1,VAR_0)
| p1(VAR_0,VAR_0,VAR_0) ),
file('theBenchmark.p',rule_066) ).
cnf(c_17,plain,
( ~ n0(B,A)
| p1(A,A,A) ),
inference(clausify,[status(thm)],[rule_066]) ).
fof(rule_137,axiom,
! [VAR_0,VAR_1,VAR_2] :
( ~ p1(VAR_1,VAR_2,VAR_0)
| n2(VAR_0) ),
file('theBenchmark.p',rule_137) ).
cnf(c_46,plain,
( ~ p1(B,C,A)
| n2(A) ),
inference(clausify,[status(thm)],[rule_137]) ).
fof(rule_244,axiom,
! [VAR_0] :
( ~ n2(VAR_0)
| p3(VAR_0,VAR_0,VAR_0) ),
file('theBenchmark.p',rule_244) ).
cnf(c_56,plain,
( ~ n2(A)
| p3(A,A,A) ),
inference(clausify,[status(thm)],[rule_244]) ).
fof(rule_299,axiom,
! [VAR_0,VAR_1,VAR_2,VAR_3] :
( ~ l1(VAR_0,VAR_2)
| ~ p3(VAR_1,VAR_2,VAR_3)
| s4(VAR_0) ),
file('theBenchmark.p',rule_299) ).
cnf(c_117,plain,
( ~ l1(A,C)
| ~ p3(B,C,D)
| s4(A) ),
inference(clausify,[status(thm)],[rule_299]) ).
fof(prove_this,axiom,
~ s4(c),
file('theBenchmark.p',prove_this) ).
cnf(c_124,plain,
~ s4(c),
inference(clausify,[status(thm)],[prove_this]) ).
cnf(c_171,plain,
( ~ p1(B,C,A)
| p3(A,A,A) ),
inference(resolve,[status(thm)],[c_56,c_46]) ).
cnf(c_236,plain,
p1(c,c,c),
inference(resolve,[status(thm)],[c_17,c_5]) ).
cnf(c_256,plain,
l1(c,c),
inference(resolve,[status(thm)],[c_10,c_5]) ).
cnf(c_551,plain,
( ~ l1(c,B)
| ~ p3(A,B,C) ),
inference(resolve,[status(thm)],[c_117,c_124]) ).
cnf(c_633,plain,
p3(c,c,c),
inference(resolve,[status(thm)],[c_236,c_171]) ).
cnf(c_859,plain,
~ p3(A,c,B),
inference(resolve,[status(thm)],[c_551,c_256]) ).
cnf(c_860,plain,
$false,
inference(resolve,[status(thm)],[c_859,c_633]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN210-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.35 % Computer : n017.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sat Sep 26 17:17:33 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.14/0.36 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.14/0.36 % Process 1253212 was started by sandbox2 on n017,
% 0.14/0.36 % Sat Sep 26 17:17:33 2026
% 0.14/0.36 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.14/0.37
% 0.14/0.37 % From the command line: assign(max_seconds, 300).
% 0.93/0.50
% 0.93/0.50 % SZS status Unsatisfiable for theBenchmark
% 0.93/0.50
% 0.93/0.50 % Proof 1 at 0.11 (+ 0.02) seconds.
% 0.93/0.50 % Length of proof is 14.
% 0.93/0.50 % Level of proof is 3.
% 0.93/0.50 % Maximum clause weight is 13.000.
% 0.93/0.50 % Given clauses 285.
% 0.93/0.50
% 0.93/0.50 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------