TSTP Solution File: CSR051+3 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : CSR051+3 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% Computer : n021.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 03:10:13 EDT 2022
% Result : Theorem 0.52s 0.72s
% Output : CNFRefutation 0.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 2
% Syntax : Number of formulae : 9 ( 3 unt; 0 def)
% Number of atoms : 15 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 11 ( 5 ~; 2 |; 1 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 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 : 4 ( 1 sgn 1 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(query151,conjecture,
? [X15] :
( mtvisible(c_tptp_member3356_mt)
=> marriagelicensedocument(X15) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',query151) ).
fof(ax2_395,axiom,
( mtvisible(c_tptp_member3356_mt)
=> marriagelicensedocument(c_tptpmarriagelicensedocument) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_395) ).
fof(c_0_2,negated_conjecture,
~ ? [X15] :
( mtvisible(c_tptp_member3356_mt)
=> marriagelicensedocument(X15) ),
inference(assume_negation,[status(cth)],[query151]) ).
fof(c_0_3,plain,
( ~ mtvisible(c_tptp_member3356_mt)
| marriagelicensedocument(c_tptpmarriagelicensedocument) ),
inference(fof_nnf,[status(thm)],[ax2_395]) ).
fof(c_0_4,negated_conjecture,
! [X5993] :
( mtvisible(c_tptp_member3356_mt)
& ~ marriagelicensedocument(X5993) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])]) ).
cnf(c_0_5,plain,
( marriagelicensedocument(c_tptpmarriagelicensedocument)
| ~ mtvisible(c_tptp_member3356_mt) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,negated_conjecture,
mtvisible(c_tptp_member3356_mt),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
~ marriagelicensedocument(X1),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_5,c_0_6])]),c_0_7]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : CSR051+3 : TPTP v8.1.0. Released v3.4.0.
% 0.04/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.13/0.35 % Computer : n021.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Fri Jun 10 02:56:39 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.52/0.72 # No SInE strategy applied
% 0.52/0.72 # Auto-Mode selected heuristic C07_19_nc_SAT001_MinMin_rr
% 0.52/0.72 # and selection function SelectMaxLComplexAvoidPosPred.
% 0.52/0.72 #
% 0.52/0.72 # Presaturation interreduction done
% 0.52/0.72
% 0.52/0.72 # Proof found!
% 0.52/0.72 # SZS status Theorem
% 0.52/0.72 # SZS output start CNFRefutation
% See solution above
% 0.52/0.72 # Training examples: 0 positive, 0 negative
%------------------------------------------------------------------------------