TSTP Solution File: CSR043+3 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : CSR043+3 : 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:17:31 EDT 2024
% Result : Theorem 0.43s 0.65s
% Output : CNFRefutation 0.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 2
% Syntax : Number of formulae : 7 ( 4 unt; 0 def)
% Number of atoms : 10 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 6 ( 3 ~; 0 |; 1 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn 0 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(query143,conjecture,
( mtvisible(c_tptp_member2862_mt)
=> genls(c_tptpcol_16_30972,c_tptpcol_15_30970) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',query143) ).
fof(ax2_1215,axiom,
genls(c_tptpcol_16_30972,c_tptpcol_15_30970),
file('/export/starexec/sandbox/benchmark/Axioms/CSR002+2.ax',ax2_1215) ).
fof(c_0_2,negated_conjecture,
~ ( mtvisible(c_tptp_member2862_mt)
=> genls(c_tptpcol_16_30972,c_tptpcol_15_30970) ),
inference(assume_negation,[status(cth)],[query143]) ).
fof(c_0_3,negated_conjecture,
( mtvisible(c_tptp_member2862_mt)
& ~ genls(c_tptpcol_16_30972,c_tptpcol_15_30970) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])]) ).
cnf(c_0_4,plain,
genls(c_tptpcol_16_30972,c_tptpcol_15_30970),
inference(split_conjunct,[status(thm)],[ax2_1215]) ).
cnf(c_0_5,negated_conjecture,
~ genls(c_tptpcol_16_30972,c_tptpcol_15_30970),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,plain,
$false,
inference(sr,[status(thm)],[c_0_4,c_0_5]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : CSR043+3 : TPTP v8.2.0. Released v3.4.0.
% 0.06/0.12 % Command : run_E %s %d THM
% 0.12/0.31 % Computer : n017.cluster.edu
% 0.12/0.31 % Model : x86_64 x86_64
% 0.12/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.31 % Memory : 8042.1875MB
% 0.12/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.31 % CPULimit : 300
% 0.12/0.31 % WCLimit : 300
% 0.12/0.31 % DateTime : Sun May 19 02:27:08 EDT 2024
% 0.16/0.31 % CPUTime :
% 0.17/0.47 Running first-order model finding
% 0.17/0.47 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.43/0.65 # Version: 3.1.0
% 0.43/0.65 # Preprocessing class: FMLLMMSLSSSNFFN.
% 0.43/0.65 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.43/0.65 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 1500s (5) cores
% 0.43/0.65 # Starting new_bool_3 with 300s (1) cores
% 0.43/0.65 # Starting new_bool_1 with 300s (1) cores
% 0.43/0.65 # Starting sh5l with 300s (1) cores
% 0.43/0.65 # new_bool_3 with pid 11153 completed with status 0
% 0.43/0.65 # Result found by new_bool_3
% 0.43/0.65 # Preprocessing class: FMLLMMSLSSSNFFN.
% 0.43/0.65 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.43/0.65 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 1500s (5) cores
% 0.43/0.65 # Starting new_bool_3 with 300s (1) cores
% 0.43/0.65 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.43/0.65 # Search class: FHUNF-FFSM00-SFFFFFNN
% 0.43/0.65 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.43/0.65 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.43/0.65 # SAT001_MinMin_p005000_rr_RG with pid 11156 completed with status 0
% 0.43/0.65 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.43/0.65 # Preprocessing class: FMLLMMSLSSSNFFN.
% 0.43/0.65 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.43/0.65 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 1500s (5) cores
% 0.43/0.65 # Starting new_bool_3 with 300s (1) cores
% 0.43/0.65 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.43/0.65 # Search class: FHUNF-FFSM00-SFFFFFNN
% 0.43/0.65 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.43/0.65 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.43/0.65 # Preprocessing time : 0.006 s
% 0.43/0.65 # Presaturation interreduction done
% 0.43/0.65
% 0.43/0.65 # Proof found!
% 0.43/0.65 # SZS status Theorem
% 0.43/0.65 # SZS output start CNFRefutation
% See solution above
% 0.43/0.65 # Parsed axioms : 8006
% 0.43/0.65 # Removed by relevancy pruning/SinE : 7982
% 0.43/0.65 # Initial clauses : 25
% 0.43/0.65 # Removed in clause preprocessing : 0
% 0.43/0.65 # Initial clauses in saturation : 25
% 0.43/0.65 # Processed clauses : 3
% 0.43/0.65 # ...of these trivial : 0
% 0.43/0.65 # ...subsumed : 0
% 0.43/0.65 # ...remaining for further processing : 2
% 0.43/0.65 # Other redundant clauses eliminated : 0
% 0.43/0.65 # Clauses deleted for lack of memory : 0
% 0.43/0.65 # Backward-subsumed : 0
% 0.43/0.65 # Backward-rewritten : 0
% 0.43/0.65 # Generated clauses : 0
% 0.43/0.65 # ...of the previous two non-redundant : 0
% 0.43/0.65 # ...aggressively subsumed : 0
% 0.43/0.65 # Contextual simplify-reflections : 0
% 0.43/0.65 # Paramodulations : 0
% 0.43/0.65 # Factorizations : 0
% 0.43/0.65 # NegExts : 0
% 0.43/0.65 # Equation resolutions : 0
% 0.43/0.65 # Disequality decompositions : 0
% 0.43/0.65 # Total rewrite steps : 0
% 0.43/0.65 # ...of those cached : 0
% 0.43/0.65 # Propositional unsat checks : 0
% 0.43/0.65 # Propositional check models : 0
% 0.43/0.65 # Propositional check unsatisfiable : 0
% 0.43/0.65 # Propositional clauses : 0
% 0.43/0.65 # Propositional clauses after purity: 0
% 0.43/0.65 # Propositional unsat core size : 0
% 0.43/0.65 # Propositional preprocessing time : 0.000
% 0.43/0.65 # Propositional encoding time : 0.000
% 0.43/0.65 # Propositional solver time : 0.000
% 0.43/0.65 # Success case prop preproc time : 0.000
% 0.43/0.65 # Success case prop encoding time : 0.000
% 0.43/0.65 # Success case prop solver time : 0.000
% 0.43/0.65 # Current number of processed clauses : 2
% 0.43/0.65 # Positive orientable unit clauses : 1
% 0.43/0.65 # Positive unorientable unit clauses: 0
% 0.43/0.65 # Negative unit clauses : 1
% 0.43/0.65 # Non-unit-clauses : 0
% 0.43/0.65 # Current number of unprocessed clauses: 22
% 0.43/0.65 # ...number of literals in the above : 40
% 0.43/0.65 # Current number of archived formulas : 0
% 0.43/0.65 # Current number of archived clauses : 0
% 0.43/0.65 # Clause-clause subsumption calls (NU) : 0
% 0.43/0.65 # Rec. Clause-clause subsumption calls : 0
% 0.43/0.65 # Non-unit clause-clause subsumptions : 0
% 0.43/0.65 # Unit Clause-clause subsumption calls : 0
% 0.43/0.65 # Rewrite failures with RHS unbound : 0
% 0.43/0.65 # BW rewrite match attempts : 0
% 0.43/0.65 # BW rewrite match successes : 0
% 0.43/0.65 # Condensation attempts : 0
% 0.43/0.65 # Condensation successes : 0
% 0.43/0.65 # Termbank termtop insertions : 51755
% 0.43/0.65 # Search garbage collected termcells : 31099
% 0.43/0.65
% 0.43/0.65 # -------------------------------------------------
% 0.43/0.65 # User time : 0.031 s
% 0.43/0.65 # System time : 0.014 s
% 0.43/0.65 # Total time : 0.044 s
% 0.43/0.65 # Maximum resident set size: 18104 pages
% 0.43/0.65
% 0.43/0.65 # -------------------------------------------------
% 0.43/0.65 # User time : 0.156 s
% 0.43/0.65 # System time : 0.023 s
% 0.43/0.65 # Total time : 0.179 s
% 0.43/0.65 # Maximum resident set size: 7956 pages
% 0.43/0.65 % E---3.1 exiting
%------------------------------------------------------------------------------