%------------------------------------------------------------------------------
% File : LEO-II---2.3.1
% Problem : CSR051+1 : TPTP v9.3.1. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : leo --cores 7 --timeout 300 --proofoutput 1 --foatp e --atp e=/export/starexec/sandbox2/solver/bin/eprover /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n005.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 : Wed Oct 7 10:14:14 AM UTC 2026
% Result : Theorem 0.09s 0.25s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 3
% Syntax : Number of formulae : 24 ( 20 unt; 0 typ; 0 def)
% Number of atoms : 84 ( 22 equ; 0 cnn)
% Maximal formula atoms : 2 ( 3 avg)
% Number of connectives : 71 ( 17 ~; 8 |; 0 &; 38 @)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 18 ( 15 usr; 6 con; 0-2 aty)
% Number of variables : 11 ( 0 ^; 6 !; 5 ?; 11 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_binarypredicate,type,
binarypredicate: $i > $o ).
thf(tp_c_basekb,type,
c_basekb: $i ).
thf(tp_c_marriagelicensedocument,type,
c_marriagelicensedocument: $i ).
thf(tp_c_tptp_member3356_mt,type,
c_tptp_member3356_mt: $i ).
thf(tp_c_tptpmarriagelicensedocument,type,
c_tptpmarriagelicensedocument: $i ).
thf(tp_collection,type,
collection: $i > $o ).
thf(tp_disjointwith,type,
disjointwith: $i > $i > $o ).
thf(tp_genlinverse,type,
genlinverse: $i > $i > $o ).
thf(tp_genlpreds,type,
genlpreds: $i > $i > $o ).
thf(tp_genls,type,
genls: $i > $i > $o ).
thf(tp_isa,type,
isa: $i > $i > $o ).
thf(tp_marriagelicensedocument,type,
marriagelicensedocument: $i > $o ).
thf(tp_mtvisible,type,
mtvisible: $i > $o ).
thf(tp_predicate,type,
predicate: $i > $o ).
thf(tp_thing,type,
thing: $i > $o ).
thf(8,axiom,
mtvisible @ c_basekb,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just20) ).
thf(27,axiom,
( ( mtvisible @ c_tptp_member3356_mt )
=> ( marriagelicensedocument @ c_tptpmarriagelicensedocument ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just1) ).
thf(28,conjecture,
? [X: $i] :
( ( mtvisible @ c_tptp_member3356_mt )
=> ( marriagelicensedocument @ X ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',query51) ).
thf(29,negated_conjecture,
( ( ? [X: $i] :
( ( mtvisible @ c_tptp_member3356_mt )
=> ( marriagelicensedocument @ X ) ) )
= $false ),
inference(negate_conjecture,[status(cth)],[28]) ).
thf(30,plain,
( ( ? [X: $i] :
( ( mtvisible @ c_tptp_member3356_mt )
=> ( marriagelicensedocument @ X ) ) )
= $false ),
inference(unfold_def,[status(thm)],[29]) ).
thf(31,plain,
( ( mtvisible @ c_basekb )
= $true ),
inference(unfold_def,[status(thm)],[8]) ).
thf(32,plain,
( ( ( mtvisible @ c_tptp_member3356_mt )
=> ( marriagelicensedocument @ c_tptpmarriagelicensedocument ) )
= $true ),
inference(unfold_def,[status(thm)],[27]) ).
thf(33,plain,
( ( ~ ? [X: $i] :
( ( mtvisible @ c_tptp_member3356_mt )
=> ( marriagelicensedocument @ X ) ) )
= $true ),
inference(polarity_switch,[status(thm)],[30]) ).
thf(34,plain,
( ( ( mtvisible @ c_tptp_member3356_mt )
=> ( marriagelicensedocument @ c_tptpmarriagelicensedocument ) )
= $true ),
inference(copy,[status(thm)],[32]) ).
thf(35,plain,
( ( mtvisible @ c_basekb )
= $true ),
inference(copy,[status(thm)],[31]) ).
thf(36,plain,
( ( ~ ? [X: $i] :
( ( mtvisible @ c_tptp_member3356_mt )
=> ( marriagelicensedocument @ X ) ) )
= $true ),
inference(copy,[status(thm)],[33]) ).
thf(37,plain,
( ( ~ ~ ! [SX0: $i] :
~ ( ~ ( mtvisible @ c_tptp_member3356_mt )
| ( marriagelicensedocument @ SX0 ) ) )
= $true ),
inference(unfold_def,[status(thm)],[36]) ).
thf(38,plain,
( ( ~ ( mtvisible @ c_tptp_member3356_mt )
| ( marriagelicensedocument @ c_tptpmarriagelicensedocument ) )
= $true ),
inference(unfold_def,[status(thm)],[34]) ).
thf(39,plain,
( ( ~ ! [SX0: $i] :
~ ( ~ ( mtvisible @ c_tptp_member3356_mt )
| ( marriagelicensedocument @ SX0 ) ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[37]) ).
thf(40,plain,
( ( ( ~ ( mtvisible @ c_tptp_member3356_mt ) )
= $true )
| ( ( marriagelicensedocument @ c_tptpmarriagelicensedocument )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[38]) ).
thf(41,plain,
( ( ! [SX0: $i] :
~ ( ~ ( mtvisible @ c_tptp_member3356_mt )
| ( marriagelicensedocument @ SX0 ) ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[39]) ).
thf(42,plain,
( ( ( mtvisible @ c_tptp_member3356_mt )
= $false )
| ( ( marriagelicensedocument @ c_tptpmarriagelicensedocument )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[40]) ).
thf(43,plain,
! [SV1: $i] :
( ( ~ ( ~ ( mtvisible @ c_tptp_member3356_mt )
| ( marriagelicensedocument @ SV1 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[41]) ).
thf(44,plain,
! [SV1: $i] :
( ( ~ ( mtvisible @ c_tptp_member3356_mt )
| ( marriagelicensedocument @ SV1 ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[43]) ).
thf(45,plain,
( ( ~ ( mtvisible @ c_tptp_member3356_mt ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[44]) ).
thf(46,plain,
! [SV1: $i] :
( ( marriagelicensedocument @ SV1 )
= $false ),
inference(extcnf_or_neg,[status(thm)],[44]) ).
thf(47,plain,
( ( mtvisible @ c_tptp_member3356_mt )
= $true ),
inference(extcnf_not_neg,[status(thm)],[45]) ).
thf(48,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[35,47,46,42]) ).
thf(49,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[48]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CSR051+1 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.05 % Command : leo --cores 7 --timeout 300 --proofoutput 1 --foatp e --atp e=/export/starexec/sandbox2/solver/bin/eprover /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.19 % Computer : n005.cluster.edu
% 0.09/0.19 % Model : x86_64 x86_64
% 0.09/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19 % Memory : 8046.5625MB
% 0.09/0.19 % OS : Linux 6.8.0-71-generic
% 0.09/0.20 % CPULimit : 300
% 0.09/0.20 % WCLimit : 300
% 0.09/0.20 % DateTime : Tue Oct 6 18:44:14 UTC 2026
% 0.09/0.20 % CPUTime :
% 0.09/0.20 Running leo --cores 7 --timeout 300 --proofoutput 1 --foatp e --atp e=/export/starexec/sandbox2/solver/bin/eprover /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.25
% 0.09/0.25 No.of.Axioms: 2
% 0.09/0.25
% 0.09/0.25 Length.of.Defs: 0
% 0.09/0.25
% 0.09/0.25 Contains.Choice.Funs: false
% 0.09/0.25
% 0.09/0.25 ********************************
% 0.09/0.25 * All subproblems solved! *
% 0.09/0.25 ********************************
% 0.09/0.25 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:1,axioms:2,ps:0,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:false,expand_extuni:false,foatp:e,atp_timeout:299,atp_calls_frequency:5,ordering:none,proof_output:1,protocol_output:false,clause_count:48,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.09/0.25
% 0.09/0.25 %**** Beginning of derivation protocol ****
% 0.09/0.25 % SZS output start CNFRefutation
% See solution above
% 0.09/0.25
% 0.09/0.25 %**** End of derivation protocol ****
% 0.09/0.25 %**** no. of clauses in derivation: 24 ****
% 0.09/0.25 %**** clause counter: 48 ****
% 0.09/0.25
% 0.09/0.25 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:1,axioms:2,ps:0,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:false,expand_extuni:false,foatp:e,atp_timeout:299,atp_calls_frequency:5,ordering:none,proof_output:1,protocol_output:false,clause_count:48,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------