TSTP Solution File: CSR051+1 by Metis---2.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Metis---2.4
% Problem : CSR051+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : metis --show proof --show saturation %s
% Computer : n025.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 : 600s
% DateTime : Fri Jul 15 21:57:07 EDT 2022
% Result : Theorem 0.12s 0.34s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 2
% Syntax : Number of formulae : 15 ( 8 unt; 0 def)
% Number of atoms : 22 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 15 ( 8 ~; 2 |; 1 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 7 ( 1 sgn 3 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(just1,axiom,
( mtvisible(c_tptp_member3356_mt)
=> marriagelicensedocument(c_tptpmarriagelicensedocument) ) ).
fof(query51,conjecture,
? [X] :
( mtvisible(c_tptp_member3356_mt)
=> marriagelicensedocument(X) ) ).
fof(subgoal_0,plain,
? [X] :
( mtvisible(c_tptp_member3356_mt)
=> marriagelicensedocument(X) ),
inference(strip,[],[query51]) ).
fof(negate_0_0,plain,
~ ? [X] :
( mtvisible(c_tptp_member3356_mt)
=> marriagelicensedocument(X) ),
inference(negate,[],[subgoal_0]) ).
fof(normalize_0_0,plain,
( ~ mtvisible(c_tptp_member3356_mt)
| marriagelicensedocument(c_tptpmarriagelicensedocument) ),
inference(canonicalize,[],[just1]) ).
fof(normalize_0_1,plain,
( mtvisible(c_tptp_member3356_mt)
& ! [X] : ~ marriagelicensedocument(X) ),
inference(canonicalize,[],[negate_0_0]) ).
fof(normalize_0_2,plain,
mtvisible(c_tptp_member3356_mt),
inference(conjunct,[],[normalize_0_1]) ).
fof(normalize_0_3,plain,
! [X] : ~ marriagelicensedocument(X),
inference(conjunct,[],[normalize_0_1]) ).
fof(normalize_0_4,plain,
! [X] : ~ marriagelicensedocument(X),
inference(specialize,[],[normalize_0_3]) ).
cnf(refute_0_0,plain,
( ~ mtvisible(c_tptp_member3356_mt)
| marriagelicensedocument(c_tptpmarriagelicensedocument) ),
inference(canonicalize,[],[normalize_0_0]) ).
cnf(refute_0_1,plain,
mtvisible(c_tptp_member3356_mt),
inference(canonicalize,[],[normalize_0_2]) ).
cnf(refute_0_2,plain,
marriagelicensedocument(c_tptpmarriagelicensedocument),
inference(resolve,[$cnf( mtvisible(c_tptp_member3356_mt) )],[refute_0_1,refute_0_0]) ).
cnf(refute_0_3,plain,
~ marriagelicensedocument(X),
inference(canonicalize,[],[normalize_0_4]) ).
cnf(refute_0_4,plain,
~ marriagelicensedocument(c_tptpmarriagelicensedocument),
inference(subst,[],[refute_0_3:[bind(X,$fot(c_tptpmarriagelicensedocument))]]) ).
cnf(refute_0_5,plain,
$false,
inference(resolve,[$cnf( marriagelicensedocument(c_tptpmarriagelicensedocument) )],[refute_0_2,refute_0_4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : CSR051+1 : TPTP v8.1.0. Released v3.4.0.
% 0.11/0.12 % Command : metis --show proof --show saturation %s
% 0.12/0.33 % Computer : n025.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Thu Jun 9 19:49:06 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.33 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.12/0.34 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.34
% 0.12/0.34 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 0.12/0.34
%------------------------------------------------------------------------------