%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : COL025-1 : 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 : n027.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:12:04 PM UTC 2026
% Result : Unsatisfiable 0.26s 1.61s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 13
% Syntax : Number of clauses : 18 ( 10 unt; 0 nHn; 7 RR)
% Number of literals : 28 ( 27 equ; 12 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 38 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(b_definition,axiom,
apply(apply(apply(b,X1),X2),X3) = apply(X1,apply(X2,X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_definition) ).
cnf(w_definition,axiom,
apply(apply(w,X1),X2) = apply(apply(X1,X2),X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',w_definition) ).
cnf(prove_fixed_point,negated_conjecture,
X1 != apply(combinator,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_fixed_point) ).
cnf(i_0_3,axiom,
apply(apply(apply(b,X1),X2),X3) = apply(X1,apply(X2,X3)),
b_definition,
[final] ).
cnf(i_0_4,axiom,
apply(apply(w,X1),X2) = apply(apply(X1,X2),X2),
w_definition,
[final] ).
cnf(i_0_5,negated_conjecture,
X1 != apply(combinator,X1),
prove_fixed_point,
[final] ).
cnf(i_0_6,axiom,
X1 = X1 ).
cnf(i_0_7,axiom,
( X1 = X2
| X2 != X1 ) ).
cnf(i_0_8,axiom,
( X1 = X2
| X1 != X3
| X3 != X2 ) ).
cnf(i_0_9,axiom,
( X1 != X2
| apply(X1,X3) = apply(X2,X3) ) ).
cnf(i_0_10,axiom,
( X1 != X2
| apply(X3,X1) = apply(X3,X2) ) ).
cnf(i_0_6_001,axiom,
X1 = X1 ).
cnf(i_0_7_002,axiom,
( X1 = X2
| X2 != X1 ) ).
cnf(i_0_8_003,axiom,
( X1 = X2
| X1 != X3
| X3 != X2 ) ).
cnf(i_0_9_004,axiom,
( X1 != X2
| apply(X1,X3) = apply(X2,X3) ) ).
cnf(i_0_10_005,axiom,
( X1 != X2
| apply(X3,X1) = apply(X3,X2) ) ).
cnf(i_0_11,plain,
apply(apply(X1,X2),X2) = apply(apply(w,X1),X2),
inference(scs_inference,[],[i_0_4,i_0_7]) ).
cnf(i_0_12,plain,
$false,
inference(scs_inference,[],[i_0_5,i_0_4,i_0_3,i_0_7,i_0_8]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : COL025-1 : TPTP v9.2.1. Released v1.0.0.
% 0.00/0.12 % 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.15/0.32 % Computer : n027.cluster.edu
% 0.15/0.32 % Model : x86_64 x86_64
% 0.15/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.32 % Memory : 8042.1875MB
% 0.15/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.32 % CPULimit : 300
% 0.15/0.32 % WCLimit : 300
% 0.15/0.32 % DateTime : Mon May 4 16:14:35 EDT 2026
% 0.15/0.32 % CPUTime :
% 0.15/0.34 % start to proof: theBenchmark
% 0.26/1.61 % Version : CSE_E---1.7
% 0.26/1.61 % Problem : theBenchmark.p
% 0.26/1.61 % SZS status Unsatisfiable for theBenchmark.p
% 0.26/1.61 % SZS output start CNFRefutation
% See solution above
% 0.26/1.62 % Total time : 1.272s
%------------------------------------------------------------------------------