%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : CAT019-3 : TPTP v9.2.1. Released v1.0.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 : n019.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:11:44 PM UTC 2026
% Result : Unsatisfiable 1.23s 1.71s
% Output : CNFRefutation 1.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of clauses : 16 ( 5 unt; 7 nHn; 9 RR)
% Number of literals : 35 ( 22 equ; 12 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 17 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(indiscernibles1,axiom,
( there_exists(f1(X1,X2))
| X1 = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/CAT003-0.ax',indiscernibles1) ).
cnf(indiscernibles2,axiom,
( X1 = f1(X1,X2)
| X2 = f1(X1,X2)
| X1 = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/CAT003-0.ax',indiscernibles2) ).
cnf(equality_of_a_and_b2,hypothesis,
( a = X1
| ~ there_exists(X1)
| b != X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equality_of_a_and_b2) ).
cnf(prove_a_equals_b,negated_conjecture,
a != b,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_a_equals_b) ).
cnf(equality_of_a_and_b1,hypothesis,
( b = X1
| ~ there_exists(X1)
| a != X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equality_of_a_and_b1) ).
cnf(c_0_5,axiom,
( there_exists(f1(X1,X2))
| X1 = X2 ),
indiscernibles1 ).
cnf(c_0_6,axiom,
( X1 = f1(X1,X2)
| X2 = f1(X1,X2)
| X1 = X2 ),
indiscernibles2 ).
cnf(c_0_7,hypothesis,
( a = X1
| ~ there_exists(X1)
| b != X1 ),
equality_of_a_and_b2 ).
cnf(c_0_8,negated_conjecture,
a != b,
prove_a_equals_b ).
cnf(c_0_9,plain,
( f1(X1,X2) = X2
| X1 = X2
| there_exists(X1) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_10,hypothesis,
( b = X1
| ~ there_exists(X1)
| a != X1 ),
equality_of_a_and_b1 ).
cnf(c_0_11,hypothesis,
~ there_exists(b),
inference(sr,[status(thm)],[inference(er,[status(thm)],[c_0_7]),c_0_8]) ).
cnf(c_0_12,plain,
( X1 = X2
| there_exists(X1)
| there_exists(X2) ),
inference(spm,[status(thm)],[c_0_5,c_0_9]) ).
cnf(c_0_13,hypothesis,
~ there_exists(a),
inference(sr,[status(thm)],[inference(er,[status(thm)],[c_0_10]),c_0_8]) ).
cnf(c_0_14,hypothesis,
( X1 = b
| there_exists(X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_8]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : CAT019-3 : TPTP v9.2.1. Released v1.0.0.
% 0.00/0.11 % 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.32 % Computer : n019.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 : Tue May 5 10:48:44 EDT 2026
% 0.15/0.32 % CPUTime :
% 0.15/0.33 % start to proof: theBenchmark
% 1.23/1.71 % Version : CSE_E---1.7
% 1.23/1.71 % Problem : theBenchmark.p
% 1.23/1.71 % SZS status Unsatisfiable for theBenchmark.p
% 1.23/1.71 % SZS output start CNFRefutation
% See solution above
% 1.23/1.71 % Total time : 1.371s
%------------------------------------------------------------------------------