%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SYN011-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n009.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 03:33:19 PM UTC 2026
% Result : Unsatisfiable 3.36s 11.09s
% Output : Proof 3.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 8
% Syntax : Number of formulae : 47 ( 6 unt; 0 def)
% Number of atoms : 106 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 95 ( 36 ~; 59 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of predicates : 8 ( 7 usr; 8 prp; 0-0 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 0 ( 0 sgn 0 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(f5,negated_conjecture,
( n
| p
| r ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_6) ).
fof(f5_nnf,plain,
( n
| p
| r ),
inference(nnf_transformation,[status(thm)],[f5]) ).
fof(f5_sk,plain,
( n
| p
| r ),
inference(skolemisation,[status(esa)],[f5_nnf]) ).
cnf(c5,plain,
( n
| p
| r ),
inference(cnf_transformation,[status(esa)],[f5_sk]) ).
cnf(f6,negated_conjecture,
( ~ l
| ~ r ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_7) ).
fof(f6_nnf,plain,
( ~ l
| ~ r ),
inference(nnf_transformation,[status(thm)],[f6]) ).
fof(f6_sk,plain,
( ~ l
| ~ r ),
inference(skolemisation,[status(esa)],[f6_nnf]) ).
cnf(c6,plain,
( ~ l
| ~ r ),
inference(cnf_transformation,[status(esa)],[f6_sk]) ).
cnf(p9,plain,
( ~ l
| n
| p ),
inference(resolution,[status(thm)],[c5,c6]) ).
cnf(f1,negated_conjecture,
( n
| q
| m ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_2) ).
fof(f1_nnf,plain,
( n
| q
| m ),
inference(nnf_transformation,[status(thm)],[f1]) ).
fof(f1_sk,plain,
( n
| q
| m ),
inference(skolemisation,[status(esa)],[f1_nnf]) ).
cnf(c1,plain,
( n
| q
| m ),
inference(cnf_transformation,[status(esa)],[f1_sk]) ).
cnf(f3,negated_conjecture,
( ~ q
| l ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_4) ).
fof(f3_nnf,plain,
( ~ q
| l ),
inference(nnf_transformation,[status(thm)],[f3]) ).
fof(f3_sk,plain,
( ~ q
| l ),
inference(skolemisation,[status(esa)],[f3_nnf]) ).
cnf(c3,plain,
( ~ q
| l ),
inference(cnf_transformation,[status(esa)],[f3_sk]) ).
cnf(p8,plain,
( l
| n
| m ),
inference(resolution,[status(thm)],[c1,c3]) ).
cnf(p11,plain,
( n
| m
| n
| p ),
inference(resolution,[status(thm)],[p9,p8]) ).
cnf(p12,plain,
( m
| n
| p ),
inference(factoring,[status(thm)],[p11]) ).
cnf(f4,negated_conjecture,
( ~ p
| ~ l ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_5) ).
fof(f4_nnf,plain,
( ~ p
| ~ l ),
inference(nnf_transformation,[status(thm)],[f4]) ).
fof(f4_sk,plain,
( ~ p
| ~ l ),
inference(skolemisation,[status(esa)],[f4_nnf]) ).
cnf(c4,plain,
( ~ p
| ~ l ),
inference(cnf_transformation,[status(esa)],[f4_sk]) ).
cnf(p10,plain,
( ~ p
| n
| m ),
inference(resolution,[status(thm)],[p8,c4]) ).
cnf(p13,plain,
( n
| m
| m
| n ),
inference(resolution,[status(thm)],[p12,p10]) ).
cnf(p14,plain,
( m
| m
| n ),
inference(factoring,[status(thm)],[p13]) ).
cnf(p16,plain,
( m
| n ),
inference(factoring,[status(thm)],[p14]) ).
cnf(f2,negated_conjecture,
( ~ m
| l ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_3) ).
fof(f2_nnf,plain,
( ~ m
| l ),
inference(nnf_transformation,[status(thm)],[f2]) ).
fof(f2_sk,plain,
( ~ m
| l ),
inference(skolemisation,[status(esa)],[f2_nnf]) ).
cnf(c2,plain,
( ~ m
| l ),
inference(cnf_transformation,[status(esa)],[f2_sk]) ).
cnf(p17,plain,
( l
| n ),
inference(resolution,[status(thm)],[p16,c2]) ).
cnf(p19,plain,
( n
| p
| n ),
inference(resolution,[status(thm)],[p17,p9]) ).
cnf(p20,plain,
( p
| n ),
inference(factoring,[status(thm)],[p19]) ).
cnf(p18,plain,
( ~ p
| n ),
inference(resolution,[status(thm)],[p17,c4]) ).
cnf(p21,plain,
( n
| n ),
inference(resolution,[status(thm)],[p20,p18]) ).
cnf(p22,plain,
n,
inference(factoring,[status(thm)],[p21]) ).
cnf(f0,negated_conjecture,
( ~ t
| ~ n ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_1) ).
fof(f0_nnf,plain,
( ~ t
| ~ n ),
inference(nnf_transformation,[status(thm)],[f0]) ).
fof(f0_sk,plain,
( ~ t
| ~ n ),
inference(skolemisation,[status(esa)],[f0_nnf]) ).
cnf(c0,plain,
( ~ t
| ~ n ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(p23,plain,
~ t,
inference(resolution,[status(thm)],[p22,c0]) ).
cnf(f7,negated_conjecture,
t,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_8) ).
fof(f7_nnf,plain,
t,
inference(nnf_transformation,[status(thm)],[f7]) ).
cnf(c7,plain,
t,
inference(cnf_transformation,[status(esa)],[f7_nnf]) ).
cnf(p24,plain,
$false,
inference(resolution,[status(thm)],[p23,c7]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN011-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.10/10.37 % Computer : n009.cluster.edu
% 0.10/10.37 % Model : x86_64 x86_64
% 0.10/10.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/10.37 % Memory : 8046.5625MB
% 0.10/10.37 % OS : Linux 6.8.0-71-generic
% 0.10/10.37 % CPULimit : 300
% 0.10/10.37 % WCLimit : 300
% 0.10/10.37 % DateTime : Thu Sep 24 23:51:09 UTC 2026
% 0.10/10.37 % CPUTime :
% 0.10/10.37 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.36/11.09 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.36/11.09 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------