TSTP Solution File: CSR048+4 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR048+4 : TPTP v8.2.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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 : Mon May 20 19:13:37 EDT 2024
% Result : Theorem 1.64s 1.33s
% Output : CNFRefutation 1.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 15 ( 6 unt; 0 def)
% Number of atoms : 27 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 22 ( 10 ~; 6 |; 2 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 10 ( 1 sgn 5 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(query198,conjecture,
? [X3] :
( mtvisible(c_tptpgeo_spindlecollectormt)
=> borderson(c_georegion_l4_x45_y9,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',query198) ).
fof(ax3_6736,axiom,
( mtvisible(c_tptpgeo_member1_mt)
=> borderson(c_georegion_l4_x45_y9,c_georegion_l4_x45_y10) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+3.ax',ax3_6736) ).
fof(ax3_44208,axiom,
! [X22,X23] :
( ( mtvisible(X22)
& genlmt(X22,X23) )
=> mtvisible(X23) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+3.ax',ax3_44208) ).
fof(ax3_4063,axiom,
genlmt(c_tptpgeo_spindlecollectormt,c_tptpgeo_member1_mt),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+3.ax',ax3_4063) ).
fof(c_0_4,negated_conjecture,
~ ? [X3] :
( mtvisible(c_tptpgeo_spindlecollectormt)
=> borderson(c_georegion_l4_x45_y9,X3) ),
inference(assume_negation,[status(cth)],[query198]) ).
fof(c_0_5,plain,
( ~ mtvisible(c_tptpgeo_member1_mt)
| borderson(c_georegion_l4_x45_y9,c_georegion_l4_x45_y10) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[ax3_6736])]) ).
fof(c_0_6,negated_conjecture,
! [X24] :
( mtvisible(c_tptpgeo_spindlecollectormt)
& ~ borderson(c_georegion_l4_x45_y9,X24) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
fof(c_0_7,plain,
! [X32,X33] :
( ~ mtvisible(X32)
| ~ genlmt(X32,X33)
| mtvisible(X33) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax3_44208])])]) ).
cnf(c_0_8,plain,
( borderson(c_georegion_l4_x45_y9,c_georegion_l4_x45_y10)
| ~ mtvisible(c_tptpgeo_member1_mt) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
~ borderson(c_georegion_l4_x45_y9,X1),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( mtvisible(X2)
| ~ mtvisible(X1)
| ~ genlmt(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
genlmt(c_tptpgeo_spindlecollectormt,c_tptpgeo_member1_mt),
inference(split_conjunct,[status(thm)],[ax3_4063]) ).
cnf(c_0_12,negated_conjecture,
mtvisible(c_tptpgeo_spindlecollectormt),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_13,plain,
~ mtvisible(c_tptpgeo_member1_mt),
inference(sr,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_14,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]),c_0_13]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : CSR048+4 : TPTP v8.2.0. Released v3.4.0.
% 0.00/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n017.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Sun May 19 01:44:38 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.15/0.41 Running first-order theorem proving
% 0.15/0.41 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 1.64/1.33 # Version: 3.1.0
% 1.64/1.33 # Preprocessing class: FMLLLMSLSSSNFFN.
% 1.64/1.33 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.64/1.33 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 1500s (5) cores
% 1.64/1.33 # Starting new_bool_3 with 300s (1) cores
% 1.64/1.33 # Starting new_bool_1 with 300s (1) cores
% 1.64/1.33 # Starting sh5l with 300s (1) cores
% 1.64/1.33 # new_bool_3 with pid 9817 completed with status 0
% 1.64/1.33 # Result found by new_bool_3
% 1.64/1.33 # Preprocessing class: FMLLLMSLSSSNFFN.
% 1.64/1.33 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.64/1.33 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 1500s (5) cores
% 1.64/1.33 # Starting new_bool_3 with 300s (1) cores
% 1.64/1.33 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.64/1.33 # Search class: FHUNF-FFSM00-SFFFFFNN
% 1.64/1.33 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.64/1.33 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 1.64/1.33 # SAT001_MinMin_p005000_rr_RG with pid 9821 completed with status 0
% 1.64/1.33 # Result found by SAT001_MinMin_p005000_rr_RG
% 1.64/1.33 # Preprocessing class: FMLLLMSLSSSNFFN.
% 1.64/1.33 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.64/1.33 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 1500s (5) cores
% 1.64/1.33 # Starting new_bool_3 with 300s (1) cores
% 1.64/1.33 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.64/1.33 # Search class: FHUNF-FFSM00-SFFFFFNN
% 1.64/1.33 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.64/1.33 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 1.64/1.33 # Preprocessing time : 0.028 s
% 1.64/1.33 # Presaturation interreduction done
% 1.64/1.33
% 1.64/1.33 # Proof found!
% 1.64/1.33 # SZS status Theorem
% 1.64/1.33 # SZS output start CNFRefutation
% See solution above
% 1.64/1.33 # Parsed axioms : 44217
% 1.64/1.33 # Removed by relevancy pruning/SinE : 44175
% 1.64/1.33 # Initial clauses : 43
% 1.64/1.33 # Removed in clause preprocessing : 0
% 1.64/1.33 # Initial clauses in saturation : 43
% 1.64/1.33 # Processed clauses : 76
% 1.64/1.33 # ...of these trivial : 7
% 1.64/1.33 # ...subsumed : 2
% 1.64/1.33 # ...remaining for further processing : 67
% 1.64/1.33 # Other redundant clauses eliminated : 0
% 1.64/1.33 # Clauses deleted for lack of memory : 0
% 1.64/1.33 # Backward-subsumed : 0
% 1.64/1.33 # Backward-rewritten : 0
% 1.64/1.33 # Generated clauses : 20
% 1.64/1.33 # ...of the previous two non-redundant : 3
% 1.64/1.33 # ...aggressively subsumed : 0
% 1.64/1.33 # Contextual simplify-reflections : 0
% 1.64/1.33 # Paramodulations : 20
% 1.64/1.33 # Factorizations : 0
% 1.64/1.33 # NegExts : 0
% 1.64/1.33 # Equation resolutions : 0
% 1.64/1.33 # Disequality decompositions : 0
% 1.64/1.33 # Total rewrite steps : 11
% 1.64/1.33 # ...of those cached : 2
% 1.64/1.33 # Propositional unsat checks : 0
% 1.64/1.33 # Propositional check models : 0
% 1.64/1.33 # Propositional check unsatisfiable : 0
% 1.64/1.33 # Propositional clauses : 0
% 1.64/1.33 # Propositional clauses after purity: 0
% 1.64/1.33 # Propositional unsat core size : 0
% 1.64/1.33 # Propositional preprocessing time : 0.000
% 1.64/1.33 # Propositional encoding time : 0.000
% 1.64/1.33 # Propositional solver time : 0.000
% 1.64/1.33 # Success case prop preproc time : 0.000
% 1.64/1.33 # Success case prop encoding time : 0.000
% 1.64/1.33 # Success case prop solver time : 0.000
% 1.64/1.33 # Current number of processed clauses : 33
% 1.64/1.33 # Positive orientable unit clauses : 21
% 1.64/1.33 # Positive unorientable unit clauses: 0
% 1.64/1.33 # Negative unit clauses : 3
% 1.64/1.33 # Non-unit-clauses : 9
% 1.64/1.33 # Current number of unprocessed clauses: 1
% 1.64/1.33 # ...number of literals in the above : 3
% 1.64/1.33 # Current number of archived formulas : 0
% 1.64/1.33 # Current number of archived clauses : 34
% 1.64/1.33 # Clause-clause subsumption calls (NU) : 55
% 1.64/1.33 # Rec. Clause-clause subsumption calls : 45
% 1.64/1.33 # Non-unit clause-clause subsumptions : 1
% 1.64/1.33 # Unit Clause-clause subsumption calls : 3
% 1.64/1.33 # Rewrite failures with RHS unbound : 0
% 1.64/1.33 # BW rewrite match attempts : 0
% 1.64/1.33 # BW rewrite match successes : 0
% 1.64/1.33 # Condensation attempts : 0
% 1.64/1.33 # Condensation successes : 0
% 1.64/1.33 # Termbank termtop insertions : 293019
% 1.64/1.33 # Search garbage collected termcells : 157694
% 1.64/1.33
% 1.64/1.33 # -------------------------------------------------
% 1.64/1.33 # User time : 0.139 s
% 1.64/1.33 # System time : 0.084 s
% 1.64/1.33 # Total time : 0.223 s
% 1.64/1.33 # Maximum resident set size: 81076 pages
% 1.64/1.33
% 1.64/1.33 # -------------------------------------------------
% 1.64/1.33 # User time : 0.801 s
% 1.64/1.33 # System time : 0.116 s
% 1.64/1.33 # Total time : 0.917 s
% 1.64/1.33 # Maximum resident set size: 33936 pages
% 1.64/1.33 % E---3.1 exiting
% 1.64/1.33 % E exiting
%------------------------------------------------------------------------------