TSTP Solution File: CSR098+3 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : CSR098+3 : TPTP v8.2.0. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% 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 : 300s
% DateTime : Mon May 20 19:18:30 EDT 2024
% Result : Theorem 5.10s 3.59s
% Output : CNFRefutation 5.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of formulae : 9 ( 9 unt; 0 def)
% Number of atoms : 9 ( 2 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 1 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(prove_from_ALL,conjecture,
s__instance(s__Animal29_1,s__Amphibian),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_from_ALL) ).
fof(local_1,axiom,
s__instance(s__Frog29_1,s__Amphibian),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',local_1) ).
fof(local_3,axiom,
s__Frog29_1 = s__Animal29_1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',local_3) ).
fof(c_0_3,negated_conjecture,
~ s__instance(s__Animal29_1,s__Amphibian),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[prove_from_ALL])]) ).
fof(c_0_4,negated_conjecture,
~ s__instance(s__Animal29_1,s__Amphibian),
inference(fof_nnf,[status(thm)],[c_0_3]) ).
cnf(c_0_5,plain,
s__instance(s__Frog29_1,s__Amphibian),
inference(split_conjunct,[status(thm)],[local_1]) ).
cnf(c_0_6,plain,
s__Frog29_1 = s__Animal29_1,
inference(split_conjunct,[status(thm)],[local_3]) ).
cnf(c_0_7,negated_conjecture,
~ s__instance(s__Animal29_1,s__Amphibian),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_5,c_0_6]),c_0_7]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : CSR098+3 : TPTP v8.2.0. Bugfixed v7.3.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n026.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 00:56:22 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.46 Running first-order model finding
% 0.19/0.46 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
% 5.10/3.59 # Version: 3.1.0
% 5.10/3.59 # Preprocessing class: FLLLSMSLSSSNFFN.
% 5.10/3.59 # Scheduled 4 strats onto 8 cores with 298 seconds (2384 total)
% 5.10/3.59 # Starting G-E--_300_C01_S5PRR_S00 with 1490s (5) cores
% 5.10/3.59 # Starting new_bool_3 with 298s (1) cores
% 5.10/3.59 # Starting new_bool_1 with 298s (1) cores
% 5.10/3.59 # Starting sh5l with 298s (1) cores
% 5.10/3.59 # new_bool_1 with pid 2793 completed with status 0
% 5.10/3.59 # Result found by new_bool_1
% 5.10/3.59 # Preprocessing class: FLLLSMSLSSSNFFN.
% 5.10/3.59 # Scheduled 4 strats onto 8 cores with 298 seconds (2384 total)
% 5.10/3.59 # Starting G-E--_300_C01_S5PRR_S00 with 1490s (5) cores
% 5.10/3.59 # Starting new_bool_3 with 298s (1) cores
% 5.10/3.59 # Starting new_bool_1 with 298s (1) cores
% 5.10/3.59 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 5.10/3.59 # Search class: FGHSM-FSLM32-MFFFFFNN
% 5.10/3.59 # Scheduled 12 strats onto 1 cores with 298 seconds (298 total)
% 5.10/3.59 # Starting G-E--_303_C18_F1_URBAN_S0Y with 25s (1) cores
% 5.10/3.59 # G-E--_303_C18_F1_URBAN_S0Y with pid 2796 completed with status 0
% 5.10/3.59 # Result found by G-E--_303_C18_F1_URBAN_S0Y
% 5.10/3.59 # Preprocessing class: FLLLSMSLSSSNFFN.
% 5.10/3.59 # Scheduled 4 strats onto 8 cores with 298 seconds (2384 total)
% 5.10/3.59 # Starting G-E--_300_C01_S5PRR_S00 with 1490s (5) cores
% 5.10/3.59 # Starting new_bool_3 with 298s (1) cores
% 5.10/3.59 # Starting new_bool_1 with 298s (1) cores
% 5.10/3.59 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 5.10/3.59 # Search class: FGHSM-FSLM32-MFFFFFNN
% 5.10/3.59 # Scheduled 12 strats onto 1 cores with 298 seconds (298 total)
% 5.10/3.59 # Starting G-E--_303_C18_F1_URBAN_S0Y with 25s (1) cores
% 5.10/3.59 # Preprocessing time : 0.030 s
% 5.10/3.59
% 5.10/3.59 # Proof found!
% 5.10/3.59 # SZS status Theorem
% 5.10/3.59 # SZS output start CNFRefutation
% See solution above
% 5.10/3.59 # Parsed axioms : 145105
% 5.10/3.59 # Removed by relevancy pruning/SinE : 144400
% 5.10/3.59 # Initial clauses : 795
% 5.10/3.59 # Removed in clause preprocessing : 19
% 5.10/3.59 # Initial clauses in saturation : 776
% 5.10/3.59 # Processed clauses : 33
% 5.10/3.59 # ...of these trivial : 0
% 5.10/3.59 # ...subsumed : 0
% 5.10/3.59 # ...remaining for further processing : 32
% 5.10/3.59 # Other redundant clauses eliminated : 0
% 5.10/3.59 # Clauses deleted for lack of memory : 0
% 5.10/3.59 # Backward-subsumed : 0
% 5.10/3.59 # Backward-rewritten : 0
% 5.10/3.59 # Generated clauses : 0
% 5.10/3.59 # ...of the previous two non-redundant : 0
% 5.10/3.59 # ...aggressively subsumed : 0
% 5.10/3.59 # Contextual simplify-reflections : 0
% 5.10/3.59 # Paramodulations : 0
% 5.10/3.59 # Factorizations : 0
% 5.10/3.59 # NegExts : 0
% 5.10/3.59 # Equation resolutions : 0
% 5.10/3.59 # Disequality decompositions : 0
% 5.10/3.59 # Total rewrite steps : 1
% 5.10/3.59 # ...of those cached : 0
% 5.10/3.59 # Propositional unsat checks : 0
% 5.10/3.59 # Propositional check models : 0
% 5.10/3.59 # Propositional check unsatisfiable : 0
% 5.10/3.59 # Propositional clauses : 0
% 5.10/3.59 # Propositional clauses after purity: 0
% 5.10/3.59 # Propositional unsat core size : 0
% 5.10/3.59 # Propositional preprocessing time : 0.000
% 5.10/3.59 # Propositional encoding time : 0.000
% 5.10/3.59 # Propositional solver time : 0.000
% 5.10/3.59 # Success case prop preproc time : 0.000
% 5.10/3.59 # Success case prop encoding time : 0.000
% 5.10/3.59 # Success case prop solver time : 0.000
% 5.10/3.59 # Current number of processed clauses : 32
% 5.10/3.59 # Positive orientable unit clauses : 23
% 5.10/3.59 # Positive unorientable unit clauses: 0
% 5.10/3.59 # Negative unit clauses : 1
% 5.10/3.59 # Non-unit-clauses : 8
% 5.10/3.59 # Current number of unprocessed clauses: 743
% 5.10/3.59 # ...number of literals in the above : 1432
% 5.10/3.59 # Current number of archived formulas : 0
% 5.10/3.59 # Current number of archived clauses : 0
% 5.10/3.59 # Clause-clause subsumption calls (NU) : 18
% 5.10/3.59 # Rec. Clause-clause subsumption calls : 11
% 5.10/3.59 # Non-unit clause-clause subsumptions : 0
% 5.10/3.59 # Unit Clause-clause subsumption calls : 2
% 5.10/3.59 # Rewrite failures with RHS unbound : 0
% 5.10/3.59 # BW rewrite match attempts : 0
% 5.10/3.59 # BW rewrite match successes : 0
% 5.10/3.59 # Condensation attempts : 0
% 5.10/3.59 # Condensation successes : 0
% 5.10/3.59 # Termbank termtop insertions : 1033446
% 5.10/3.59 # Search garbage collected termcells : 461663
% 5.10/3.59
% 5.10/3.59 # -------------------------------------------------
% 5.10/3.59 # User time : 0.361 s
% 5.10/3.59 # System time : 0.125 s
% 5.10/3.59 # Total time : 0.486 s
% 5.10/3.59 # Maximum resident set size: 172704 pages
% 5.10/3.59
% 5.10/3.59 # -------------------------------------------------
% 5.10/3.59 # User time : 2.785 s
% 5.10/3.59 # System time : 0.220 s
% 5.10/3.59 # Total time : 3.005 s
% 5.10/3.59 # Maximum resident set size: 98068 pages
% 5.10/3.59 % E---3.1 exiting
%------------------------------------------------------------------------------