%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : CSR051-10 : TPTP v9.2.1. Released v7.3.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 : n005.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:14:27 PM UTC 2026
% Result : Unsatisfiable 2.38s 2.15s
% Output : CNFRefutation 2.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of clauses : 16 ( 16 unt; 0 nHn; 10 RR)
% Number of literals : 16 ( 15 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-4 aty)
% Number of variables : 14 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(ax2_395,axiom,
ifeq4(mtvisible(c_tptp_member3356_mt),true,marriagelicensedocument(c_tptpmarriagelicensedocument),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax2_395) ).
cnf(query151,negated_conjecture,
mtvisible(c_tptp_member3356_mt) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',query151) ).
cnf(ifeq_axiom,axiom,
ifeq4(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ifeq_axiom) ).
cnf(query151_1,negated_conjecture,
ifeq3(marriagelicensedocument(X1),true,a,b) = b,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',query151_1) ).
cnf(ifeq_axiom_001,axiom,
ifeq3(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ifeq_axiom_001) ).
cnf(goal,negated_conjecture,
a != b,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal) ).
cnf(c_0_6,axiom,
ifeq4(mtvisible(c_tptp_member3356_mt),true,marriagelicensedocument(c_tptpmarriagelicensedocument),true) = true,
ax2_395 ).
cnf(c_0_7,negated_conjecture,
mtvisible(c_tptp_member3356_mt) = true,
query151 ).
cnf(c_0_8,plain,
ifeq4(true,true,marriagelicensedocument(c_tptpmarriagelicensedocument),true) = true,
inference(rw,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,axiom,
ifeq4(X1,X1,X2,X3) = X2,
ifeq_axiom ).
cnf(c_0_10,negated_conjecture,
ifeq3(marriagelicensedocument(X1),true,a,b) = b,
query151_1 ).
cnf(c_0_11,plain,
marriagelicensedocument(c_tptpmarriagelicensedocument) = true,
inference(rw,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,negated_conjecture,
ifeq3(true,true,a,b) = b,
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_13,axiom,
ifeq3(X1,X1,X2,X3) = X2,
ifeq_axiom_001 ).
cnf(c_0_14,negated_conjecture,
a != b,
goal ).
cnf(c_0_15,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13]),c_0_14]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : CSR051-10 : TPTP v9.2.1. Released v7.3.0.
% 0.12/0.13 % 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.18/0.35 % Computer : n005.cluster.edu
% 0.18/0.35 % Model : x86_64 x86_64
% 0.18/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.35 % Memory : 8042.1875MB
% 0.18/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.18/0.35 % CPULimit : 300
% 0.18/0.35 % WCLimit : 300
% 0.18/0.35 % DateTime : Mon May 4 16:35:15 EDT 2026
% 0.18/0.35 % CPUTime :
% 0.21/0.36 % start to proof: theBenchmark
% 2.38/2.15 % Version : CSE_E---1.7
% 2.38/2.15 % Problem : theBenchmark.p
% 2.38/2.15 % SZS status Unsatisfiable for theBenchmark.p
% 2.38/2.15 % SZS output start CNFRefutation
% See solution above
% 2.38/2.16 % Total time : 1.662s
%------------------------------------------------------------------------------