%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SYN002-1.007.008 : TPTP v9.2.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n024.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 05:35:07 PM UTC 2026
% Result : Unsatisfiable 0.12s 1.53s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 2
% Syntax : Number of clauses : 17 ( 4 unt; 5 nHn; 10 RR)
% Number of literals : 30 ( 0 equ; 11 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 9 ( 4 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 0 con; 1-1 aty)
% Number of variables : 16 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(negative,negated_conjecture,
( ~ p(X1)
| ~ p(f(f(f(f(f(f(f(f(X1))))))))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',negative) ).
cnf(positive,negated_conjecture,
( p(X1)
| p(f(f(f(f(f(f(f(X1)))))))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',positive) ).
cnf(i_0_2,negated_conjecture,
( ~ p(X1)
| ~ p(f(f(f(f(f(f(f(f(X1))))))))) ),
negative,
[final] ).
cnf(i_0_3,negated_conjecture,
( p(X1)
| p(f(f(f(f(f(f(f(X1)))))))) ),
positive,
[final] ).
cnf(i_0_4,plain,
( p(f(f(f(f(f(f(f(X1))))))))
| ~ p(f(f(f(f(f(f(f(f(X1))))))))) ),
inference(scs_inference,[],[i_0_3,i_0_2]) ).
cnf(i_0_5,plain,
( p(f(f(f(f(f(f(f(X1))))))))
| p(f(X1)) ),
inference(scs_inference,[],[i_0_4,i_0_3]) ).
cnf(i_0_6,plain,
( p(f(f(X1)))
| ~ p(X1) ),
inference(scs_inference,[],[i_0_5,i_0_2]) ).
cnf(i_0_7,plain,
( p(f(f(f(X1))))
| p(f(f(f(f(f(f(f(X1)))))))) ),
inference(scs_inference,[],[i_0_6,i_0_5]) ).
cnf(i_0_8,plain,
( p(f(f(f(f(X1)))))
| ~ p(X1) ),
inference(scs_inference,[],[i_0_7,i_0_2]) ).
cnf(i_0_9,plain,
( ~ p(X1)
| p(f(f(f(f(f(f(X1))))))) ),
inference(scs_inference,[],[i_0_8,i_0_6]) ).
cnf(i_0_10,plain,
( ~ p(f(f(X1)))
| p(f(f(f(f(f(f(f(X1)))))))) ),
inference(scs_inference,[],[i_0_9,i_0_4]) ).
cnf(i_0_11,plain,
( p(f(f(f(f(f(f(f(X1))))))))
| p(f(f(f(f(f(f(f(f(X1))))))))) ),
inference(scs_inference,[],[i_0_10,i_0_5]) ).
cnf(i_0_12,plain,
( p(f(f(f(f(f(f(f(X1))))))))
| ~ p(X1) ),
inference(scs_inference,[],[i_0_11,i_0_2]) ).
cnf(i_0_13,plain,
p(f(f(f(f(f(f(f(X1)))))))),
inference(scs_inference,[],[i_0_12,i_0_3]) ).
cnf(i_0_14,plain,
~ p(X1),
inference(scs_inference,[],[i_0_13,i_0_2]) ).
cnf(i_0_15,plain,
p(f(f(f(f(f(f(f(X1)))))))),
inference(rename_variables,[],[i_0_13]) ).
cnf(i_0_16,plain,
$false,
inference(scs_inference,[],[i_0_13,i_0_15,i_0_2,i_0_8]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07 % Problem : SYN002-1.007.008 : TPTP v9.2.1. Released v1.0.0.
% 0.00/0.07 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.07/0.26 % Computer : n024.cluster.edu
% 0.07/0.26 % Model : x86_64 x86_64
% 0.07/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.26 % Memory : 8042.1875MB
% 0.07/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.26 % CPULimit : 300
% 0.07/0.26 % WCLimit : 300
% 0.07/0.26 % DateTime : Tue May 5 03:03:11 EDT 2026
% 0.07/0.26 % CPUTime :
% 0.07/0.26 % start to proof: theBenchmark
% 0.12/1.53 % Version : CSE_E---1.7
% 0.12/1.53 % Problem : theBenchmark.p
% 0.12/1.53 % SZS status Unsatisfiable for theBenchmark.p
% 0.12/1.53 % SZS output start CNFRefutation
% See solution above
% 0.12/1.54 % Total time : 1.262s
%------------------------------------------------------------------------------