%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : NUM228-1 : TPTP v9.2.1. Bugfixed v2.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 : n008.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:52:58 PM UTC 2026
% Result : Unsatisfiable 1.32s 1.73s
% Output : CNFRefutation 1.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 10 ( 6 unt; 2 nHn; 8 RR)
% Number of literals : 14 ( 4 equ; 7 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-1 aty)
% Number of variables : 7 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_corollary_1,negated_conjecture,
~ function(z),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_corollary_1) ).
cnf(recursion_equation_functions1,axiom,
( function(X2)
| ~ member(X1,recursion_equation_functions(X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM004-0.ax',recursion_equation_functions1) ).
cnf(regularity1,axiom,
( X1 = null_class
| member(regular(X1),X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',regularity1) ).
cnf(prove_corollary_2,negated_conjecture,
recursion_equation_functions(z) != null_class,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_corollary_2) ).
cnf(c_0_4,negated_conjecture,
~ function(z),
prove_corollary_1 ).
cnf(c_0_5,axiom,
( function(X2)
| ~ member(X1,recursion_equation_functions(X2)) ),
recursion_equation_functions1 ).
cnf(c_0_6,negated_conjecture,
~ member(X1,recursion_equation_functions(z)),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_7,axiom,
( X1 = null_class
| member(regular(X1),X1) ),
regularity1 ).
cnf(c_0_8,negated_conjecture,
recursion_equation_functions(z) != null_class,
prove_corollary_2 ).
cnf(c_0_9,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM228-1 : TPTP v9.2.1. Bugfixed v2.1.0.
% 0.00/0.12 % 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.15/0.33 % Computer : n008.cluster.edu
% 0.15/0.33 % Model : x86_64 x86_64
% 0.15/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33 % Memory : 8042.1875MB
% 0.15/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33 % CPULimit : 300
% 0.15/0.33 % WCLimit : 300
% 0.15/0.33 % DateTime : Tue May 5 00:20:28 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.34 % start to proof: theBenchmark
% 1.32/1.73 % Version : CSE_E---1.7
% 1.32/1.73 % Problem : theBenchmark.p
% 1.32/1.73 % SZS status Unsatisfiable for theBenchmark.p
% 1.32/1.73 % SZS output start CNFRefutation
% See solution above
% 1.32/1.73 % Total time : 1.373s
%------------------------------------------------------------------------------