%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : CSR051+4 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n026.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:01:51 EDT 2022
% Result : Theorem 12.93s 15.11s
% Output : CNFRefutation 12.93s
% 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(query201,conjecture,
? [X16] :
( mtvisible(c_tptp_member3356_mt)
=> marriagelicensedocument(X16) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',query201) ).
fof(ax3_12494,axiom,
( mtvisible(c_tptp_member3356_mt)
=> marriagelicensedocument(c_tptpmarriagelicensedocument) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+3.ax',ax3_12494) ).
fof(c_0_2,negated_conjecture,
~ ? [X16] :
( mtvisible(c_tptp_member3356_mt)
=> marriagelicensedocument(X16) ),
inference(assume_negation,[status(cth)],[query201]) ).
fof(c_0_3,plain,
( ~ mtvisible(c_tptp_member3356_mt)
| marriagelicensedocument(c_tptpmarriagelicensedocument) ),
inference(fof_nnf,[status(thm)],[ax3_12494]) ).
fof(c_0_4,negated_conjecture,
! [X17] :
( mtvisible(c_tptp_member3356_mt)
& ~ marriagelicensedocument(X17) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[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.03/0.12 % Problem : CSR051+4 : TPTP v8.1.0. Released v3.4.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n026.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.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Thu Jun 9 17:35:03 EDT 2022
% 0.12/0.34 % CPUTime :
% 12.93/15.11 # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 12.93/15.11 # Preprocessing time : 1.589 s
% 12.93/15.11
% 12.93/15.11 # Proof found!
% 12.93/15.11 # SZS status Theorem
% 12.93/15.11 # SZS output start CNFRefutation
% See solution above
% 12.93/15.11 # Proof object total steps : 9
% 12.93/15.11 # Proof object clause steps : 4
% 12.93/15.11 # Proof object formula steps : 5
% 12.93/15.11 # Proof object conjectures : 5
% 12.93/15.11 # Proof object clause conjectures : 2
% 12.93/15.11 # Proof object formula conjectures : 3
% 12.93/15.11 # Proof object initial clauses used : 3
% 12.93/15.11 # Proof object initial formulas used : 2
% 12.93/15.11 # Proof object generating inferences : 0
% 12.93/15.11 # Proof object simplifying inferences : 3
% 12.93/15.11 # Training examples: 0 positive, 0 negative
% 12.93/15.11 # Parsed axioms : 44217
% 12.93/15.11 # Removed by relevancy pruning/SinE : 0
% 12.93/15.11 # Initial clauses : 44218
% 12.93/15.11 # Removed in clause preprocessing : 3
% 12.93/15.11 # Initial clauses in saturation : 44215
% 12.93/15.11 # Processed clauses : 12
% 12.93/15.11 # ...of these trivial : 0
% 12.93/15.11 # ...subsumed : 0
% 12.93/15.11 # ...remaining for further processing : 11
% 12.93/15.11 # Other redundant clauses eliminated : 0
% 12.93/15.11 # Clauses deleted for lack of memory : 0
% 12.93/15.11 # Backward-subsumed : 0
% 12.93/15.11 # Backward-rewritten : 0
% 12.93/15.11 # Generated clauses : 0
% 12.93/15.11 # ...of the previous two non-trivial : 0
% 12.93/15.11 # Contextual simplify-reflections : 0
% 12.93/15.11 # Paramodulations : 0
% 12.93/15.11 # Factorizations : 0
% 12.93/15.11 # Equation resolutions : 0
% 12.93/15.11 # Current number of processed clauses : 11
% 12.93/15.11 # Positive orientable unit clauses : 8
% 12.93/15.11 # Positive unorientable unit clauses: 0
% 12.93/15.11 # Negative unit clauses : 3
% 12.93/15.11 # Non-unit-clauses : 0
% 12.93/15.11 # Current number of unprocessed clauses: 44203
% 12.93/15.11 # ...number of literals in the above : 65435
% 12.93/15.11 # Current number of archived formulas : 0
% 12.93/15.11 # Current number of archived clauses : 0
% 12.93/15.11 # Clause-clause subsumption calls (NU) : 0
% 12.93/15.11 # Rec. Clause-clause subsumption calls : 0
% 12.93/15.11 # Non-unit clause-clause subsumptions : 0
% 12.93/15.11 # Unit Clause-clause subsumption calls : 3
% 12.93/15.11 # Rewrite failures with RHS unbound : 0
% 12.93/15.11 # BW rewrite match attempts : 0
% 12.93/15.11 # BW rewrite match successes : 0
% 12.93/15.11 # Condensation attempts : 0
% 12.93/15.11 # Condensation successes : 0
% 12.93/15.11 # Termbank termtop insertions : 1539195
% 12.93/15.11
% 12.93/15.11 # -------------------------------------------------
% 12.93/15.11 # User time : 1.544 s
% 12.93/15.11 # System time : 0.068 s
% 12.93/15.11 # Total time : 1.612 s
% 12.93/15.11 # Maximum resident set size: 125192 pages
%------------------------------------------------------------------------------