%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : CSR051-10 : TPTP v9.3.1. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n004.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun Sep 27 07:04:00 AM UTC 2026
% Result : Unsatisfiable 84.74s 11.98s
% Output : CNFRefutation 84.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of clauses : 17 ( 17 unt; 0 nHn; 11 RR)
% Number of literals : 17 ( 16 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(ifeq_axiom,axiom,
ifeq4(X0,X0,X1,X2) = X1 ).
cnf(ifeq_axiom_001,axiom,
ifeq3(X0,X0,X1,X2) = X1 ).
cnf(ax2_395,axiom,
ifeq4(mtvisible('c$utptp$umember3356$umt'),true,marriagelicensedocument('c$utptpmarriagelicensedocument'),true) = true ).
cnf(query151,negated_conjecture,
mtvisible('c$utptp$umember3356$umt') = true ).
cnf(query151_1,negated_conjecture,
ifeq3(marriagelicensedocument(X0),true,a,b) = b ).
cnf(goal,negated_conjecture,
a != b ).
cnf(c0,plain,
ifeq4(X0,X0,X1,X2) = X1,
inference(clausification,[status(esa)],[ifeq_axiom]) ).
cnf(c1,plain,
ifeq3(X0,X0,X1,X2) = X1,
inference(clausification,[status(esa)],[ifeq_axiom_001]) ).
cnf(c397,plain,
ifeq4(mtvisible('c$utptp$umember3356$umt'),true,marriagelicensedocument('c$utptpmarriagelicensedocument'),true) = true,
inference(clausification,[status(esa)],[ax2_395]) ).
cnf(c7935,plain,
mtvisible('c$utptp$umember3356$umt') = true,
inference(clausification,[status(esa)],[query151]) ).
cnf(c8010,plain,
ifeq3(marriagelicensedocument(X0),true,a,b) = b,
inference(clausification,[status(esa)],[query151_1]) ).
cnf(c8011,plain,
a != b,
inference(clausification,[status(esa)],[goal]) ).
cnf(d0,plain,
ifeq4(true,true,marriagelicensedocument('c$utptpmarriagelicensedocument'),true) = true,
inference(demodulation,[status(thm)],[c397,c7935]) ).
cnf(d1,plain,
marriagelicensedocument('c$utptpmarriagelicensedocument') = true,
inference(demodulation,[status(thm)],[d0,c0]) ).
cnf(d2,plain,
ifeq3(true,true,a,b) = b,
inference(superposition,[status(thm)],[d1,c8010]) ).
cnf(d3,plain,
a = b,
inference(demodulation,[status(thm)],[d2,c1]) ).
cnf(d4,plain,
$false,
inference(resolution,[status(thm)],[c8011,d3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CSR051-10 : TPTP v9.3.1. Released v7.3.0.
% 0.00/0.04 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.37 % Computer : n004.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Sun Sep 27 00:19:08 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 84.74/11.98 % SZS status Unsatisfiable for theBenchmark.p
% 84.74/11.98 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------