TSTP Solution File: CSR051+3 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR051+3 : TPTP v8.1.2. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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 : 300s
% DateTime : Sat May 4 07:31:44 EDT 2024
% Result : Theorem 1.70s 2.04s
% Output : CNFRefutation 1.70s
% 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/sandbox/tmp/tmp.0XRkVe5V7a/E---3.1_20280.p',query151) ).
fof(ax2_395,axiom,
( mtvisible(c_tptp_member3356_mt)
=> marriagelicensedocument(c_tptpmarriagelicensedocument) ),
file('/export/starexec/sandbox/tmp/tmp.0XRkVe5V7a/E---3.1_20280.p',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)],[inference(fof_nnf,[status(thm)],[ax2_395])]) ).
fof(c_0_4,negated_conjecture,
! [X23] :
( mtvisible(c_tptp_member3356_mt)
& ~ marriagelicensedocument(X23) ),
inference(fof_nnf,[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.70/0.74 % Problem : CSR051+3 : TPTP v8.1.2. Released v3.4.0.
% 0.70/0.75 % Command : run_E %s %d THM
% 0.75/0.96 % Computer : n022.cluster.edu
% 0.75/0.96 % Model : x86_64 x86_64
% 0.75/0.96 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.75/0.96 % Memory : 8042.1875MB
% 0.75/0.96 % OS : Linux 3.10.0-693.el7.x86_64
% 0.75/0.96 % CPULimit : 300
% 0.75/0.96 % WCLimit : 300
% 0.75/0.96 % DateTime : Fri May 3 14:32:08 EDT 2024
% 0.75/0.96 % CPUTime :
% 1.64/1.87 Running first-order theorem proving
% 1.64/1.87 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.0XRkVe5V7a/E---3.1_20280.p
% 1.70/2.04 # Version: 3.1.0
% 1.70/2.04 # Preprocessing class: FMLLMMSLSSSNFFN.
% 1.70/2.04 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.70/2.04 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 1500s (5) cores
% 1.70/2.04 # Starting new_bool_3 with 300s (1) cores
% 1.70/2.04 # Starting new_bool_1 with 300s (1) cores
% 1.70/2.04 # Starting sh5l with 300s (1) cores
% 1.70/2.04 # new_bool_1 with pid 20453 completed with status 0
% 1.70/2.04 # Result found by new_bool_1
% 1.70/2.04 # Preprocessing class: FMLLMMSLSSSNFFN.
% 1.70/2.04 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.70/2.04 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 1500s (5) cores
% 1.70/2.04 # Starting new_bool_3 with 300s (1) cores
% 1.70/2.04 # Starting new_bool_1 with 300s (1) cores
% 1.70/2.04 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.70/2.04 # Search class: FHUNF-FFSM00-SFFFFFNN
% 1.70/2.04 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.70/2.04 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 1.70/2.04 # SAT001_MinMin_p005000_rr_RG with pid 20456 completed with status 0
% 1.70/2.04 # Result found by SAT001_MinMin_p005000_rr_RG
% 1.70/2.04 # Preprocessing class: FMLLMMSLSSSNFFN.
% 1.70/2.04 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.70/2.04 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 1500s (5) cores
% 1.70/2.04 # Starting new_bool_3 with 300s (1) cores
% 1.70/2.04 # Starting new_bool_1 with 300s (1) cores
% 1.70/2.04 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.70/2.04 # Search class: FHUNF-FFSM00-SFFFFFNN
% 1.70/2.04 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.70/2.04 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 1.70/2.04 # Preprocessing time : 0.006 s
% 1.70/2.04 # Presaturation interreduction done
% 1.70/2.04
% 1.70/2.04 # Proof found!
% 1.70/2.04 # SZS status Theorem
% 1.70/2.04 # SZS output start CNFRefutation
% See solution above
% 1.70/2.04 # Parsed axioms : 8006
% 1.70/2.04 # Removed by relevancy pruning/SinE : 7993
% 1.70/2.04 # Initial clauses : 14
% 1.70/2.04 # Removed in clause preprocessing : 0
% 1.70/2.04 # Initial clauses in saturation : 14
% 1.70/2.04 # Processed clauses : 4
% 1.70/2.04 # ...of these trivial : 0
% 1.70/2.04 # ...subsumed : 0
% 1.70/2.04 # ...remaining for further processing : 3
% 1.70/2.04 # Other redundant clauses eliminated : 0
% 1.70/2.04 # Clauses deleted for lack of memory : 0
% 1.70/2.04 # Backward-subsumed : 0
% 1.70/2.04 # Backward-rewritten : 0
% 1.70/2.04 # Generated clauses : 0
% 1.70/2.04 # ...of the previous two non-redundant : 0
% 1.70/2.04 # ...aggressively subsumed : 0
% 1.70/2.04 # Contextual simplify-reflections : 0
% 1.70/2.04 # Paramodulations : 0
% 1.70/2.04 # Factorizations : 0
% 1.70/2.04 # NegExts : 0
% 1.70/2.04 # Equation resolutions : 0
% 1.70/2.04 # Disequality decompositions : 0
% 1.70/2.04 # Total rewrite steps : 1
% 1.70/2.04 # ...of those cached : 0
% 1.70/2.04 # Propositional unsat checks : 0
% 1.70/2.04 # Propositional check models : 0
% 1.70/2.04 # Propositional check unsatisfiable : 0
% 1.70/2.04 # Propositional clauses : 0
% 1.70/2.04 # Propositional clauses after purity: 0
% 1.70/2.04 # Propositional unsat core size : 0
% 1.70/2.04 # Propositional preprocessing time : 0.000
% 1.70/2.04 # Propositional encoding time : 0.000
% 1.70/2.04 # Propositional solver time : 0.000
% 1.70/2.04 # Success case prop preproc time : 0.000
% 1.70/2.04 # Success case prop encoding time : 0.000
% 1.70/2.04 # Success case prop solver time : 0.000
% 1.70/2.04 # Current number of processed clauses : 3
% 1.70/2.04 # Positive orientable unit clauses : 2
% 1.70/2.04 # Positive unorientable unit clauses: 0
% 1.70/2.04 # Negative unit clauses : 1
% 1.70/2.04 # Non-unit-clauses : 0
% 1.70/2.04 # Current number of unprocessed clauses: 10
% 1.70/2.04 # ...number of literals in the above : 15
% 1.70/2.04 # Current number of archived formulas : 0
% 1.70/2.04 # Current number of archived clauses : 0
% 1.70/2.04 # Clause-clause subsumption calls (NU) : 0
% 1.70/2.04 # Rec. Clause-clause subsumption calls : 0
% 1.70/2.04 # Non-unit clause-clause subsumptions : 0
% 1.70/2.04 # Unit Clause-clause subsumption calls : 0
% 1.70/2.04 # Rewrite failures with RHS unbound : 0
% 1.70/2.04 # BW rewrite match attempts : 0
% 1.70/2.04 # BW rewrite match successes : 0
% 1.70/2.04 # Condensation attempts : 0
% 1.70/2.04 # Condensation successes : 0
% 1.70/2.04 # Termbank termtop insertions : 51243
% 1.70/2.04 # Search garbage collected termcells : 31037
% 1.70/2.04
% 1.70/2.04 # -------------------------------------------------
% 1.70/2.04 # User time : 0.025 s
% 1.70/2.04 # System time : 0.016 s
% 1.70/2.04 # Total time : 0.040 s
% 1.70/2.04 # Maximum resident set size: 18200 pages
% 1.70/2.04
% 1.70/2.04 # -------------------------------------------------
% 1.70/2.04 # User time : 0.135 s
% 1.70/2.04 # System time : 0.025 s
% 1.70/2.04 # Total time : 0.161 s
% 1.70/2.04 # Maximum resident set size: 8064 pages
% 1.70/2.04 % E---3.1 exiting
% 1.70/2.04 % E exiting
%------------------------------------------------------------------------------