TSTP Solution File: SYN395+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYN395+1 : TPTP v8.2.0. Released v2.0.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 : Tue May 21 07:44:37 EDT 2024
% Result : Theorem 0.11s 0.34s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 1
% Syntax : Number of formulae : 8 ( 4 unt; 0 def)
% Number of atoms : 18 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 16 ( 6 ~; 2 |; 2 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 11 ( 2 sgn 4 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(kalish202,conjecture,
( ! [X1] :
( f(X1)
=> g(X1) )
=> ( ? [X2] : f(X2)
=> ? [X3] : g(X3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',kalish202) ).
fof(c_0_1,negated_conjecture,
~ ( ! [X1] :
( f(X1)
=> g(X1) )
=> ( ? [X2] : f(X2)
=> ? [X3] : g(X3) ) ),
inference(assume_negation,[status(cth)],[kalish202]) ).
fof(c_0_2,negated_conjecture,
! [X4,X6] :
( ( ~ f(X4)
| g(X4) )
& f(esk1_0)
& ~ g(X6) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])]) ).
cnf(c_0_3,negated_conjecture,
( g(X1)
| ~ f(X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
~ g(X1),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5,negated_conjecture,
f(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6,negated_conjecture,
~ f(X1),
inference(sr,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_7,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_5,c_0_6]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.07 % Problem : SYN395+1 : TPTP v8.2.0. Released v2.0.0.
% 0.06/0.07 % Command : run_E %s %d THM
% 0.06/0.26 % Computer : n022.cluster.edu
% 0.06/0.26 % Model : x86_64 x86_64
% 0.06/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.26 % Memory : 8042.1875MB
% 0.06/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.06/0.26 % CPULimit : 300
% 0.06/0.26 % WCLimit : 300
% 0.06/0.26 % DateTime : Mon May 20 13:50:07 EDT 2024
% 0.06/0.26 % CPUTime :
% 0.11/0.34 Running first-order theorem proving
% 0.11/0.34 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/benchmark/theBenchmark.p
% 0.11/0.34 # Version: 3.1.0
% 0.11/0.34 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.11/0.34 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.34 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.11/0.34 # Starting new_bool_3 with 300s (1) cores
% 0.11/0.34 # Starting new_bool_1 with 300s (1) cores
% 0.11/0.34 # Starting sh5l with 300s (1) cores
% 0.11/0.34 # new_bool_3 with pid 11542 completed with status 0
% 0.11/0.34 # Result found by new_bool_3
% 0.11/0.34 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.11/0.34 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.34 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.11/0.34 # Starting new_bool_3 with 300s (1) cores
% 0.11/0.34 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/0.34 # Search class: FHUNF-FFSF00-SFFFFFNN
% 0.11/0.34 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.34 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.11/0.34 # SAT001_MinMin_p005000_rr_RG with pid 11545 completed with status 0
% 0.11/0.34 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.11/0.34 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.11/0.34 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.34 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.11/0.34 # Starting new_bool_3 with 300s (1) cores
% 0.11/0.34 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/0.34 # Search class: FHUNF-FFSF00-SFFFFFNN
% 0.11/0.34 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.34 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.11/0.34 # Preprocessing time : 0.001 s
% 0.11/0.34 # Presaturation interreduction done
% 0.11/0.34
% 0.11/0.34 # Proof found!
% 0.11/0.34 # SZS status Theorem
% 0.11/0.34 # SZS output start CNFRefutation
% See solution above
% 0.11/0.34 # Parsed axioms : 1
% 0.11/0.34 # Removed by relevancy pruning/SinE : 0
% 0.11/0.34 # Initial clauses : 3
% 0.11/0.34 # Removed in clause preprocessing : 0
% 0.11/0.34 # Initial clauses in saturation : 3
% 0.11/0.34 # Processed clauses : 3
% 0.11/0.34 # ...of these trivial : 0
% 0.11/0.34 # ...subsumed : 0
% 0.11/0.34 # ...remaining for further processing : 3
% 0.11/0.34 # Other redundant clauses eliminated : 0
% 0.11/0.34 # Clauses deleted for lack of memory : 0
% 0.11/0.34 # Backward-subsumed : 0
% 0.11/0.34 # Backward-rewritten : 0
% 0.11/0.34 # Generated clauses : 1
% 0.11/0.34 # ...of the previous two non-redundant : 0
% 0.11/0.34 # ...aggressively subsumed : 0
% 0.11/0.34 # Contextual simplify-reflections : 0
% 0.11/0.34 # Paramodulations : 0
% 0.11/0.34 # Factorizations : 0
% 0.11/0.34 # NegExts : 0
% 0.11/0.34 # Equation resolutions : 0
% 0.11/0.34 # Disequality decompositions : 0
% 0.11/0.34 # Total rewrite steps : 0
% 0.11/0.34 # ...of those cached : 0
% 0.11/0.34 # Propositional unsat checks : 0
% 0.11/0.34 # Propositional check models : 0
% 0.11/0.34 # Propositional check unsatisfiable : 0
% 0.11/0.34 # Propositional clauses : 0
% 0.11/0.34 # Propositional clauses after purity: 0
% 0.11/0.34 # Propositional unsat core size : 0
% 0.11/0.34 # Propositional preprocessing time : 0.000
% 0.11/0.34 # Propositional encoding time : 0.000
% 0.11/0.34 # Propositional solver time : 0.000
% 0.11/0.34 # Success case prop preproc time : 0.000
% 0.11/0.34 # Success case prop encoding time : 0.000
% 0.11/0.34 # Success case prop solver time : 0.000
% 0.11/0.34 # Current number of processed clauses : 2
% 0.11/0.34 # Positive orientable unit clauses : 0
% 0.11/0.34 # Positive unorientable unit clauses: 0
% 0.11/0.34 # Negative unit clauses : 2
% 0.11/0.34 # Non-unit-clauses : 0
% 0.11/0.34 # Current number of unprocessed clauses: 0
% 0.11/0.34 # ...number of literals in the above : 0
% 0.11/0.34 # Current number of archived formulas : 0
% 0.11/0.34 # Current number of archived clauses : 1
% 0.11/0.34 # Clause-clause subsumption calls (NU) : 0
% 0.11/0.34 # Rec. Clause-clause subsumption calls : 0
% 0.11/0.34 # Non-unit clause-clause subsumptions : 0
% 0.11/0.34 # Unit Clause-clause subsumption calls : 0
% 0.11/0.34 # Rewrite failures with RHS unbound : 0
% 0.11/0.34 # BW rewrite match attempts : 0
% 0.11/0.34 # BW rewrite match successes : 0
% 0.11/0.34 # Condensation attempts : 0
% 0.11/0.34 # Condensation successes : 0
% 0.11/0.34 # Termbank termtop insertions : 154
% 0.11/0.34 # Search garbage collected termcells : 61
% 0.11/0.34
% 0.11/0.34 # -------------------------------------------------
% 0.11/0.34 # User time : 0.001 s
% 0.11/0.34 # System time : 0.001 s
% 0.11/0.34 # Total time : 0.002 s
% 0.11/0.34 # Maximum resident set size: 1588 pages
% 0.11/0.34
% 0.11/0.34 # -------------------------------------------------
% 0.11/0.34 # User time : 0.002 s
% 0.11/0.34 # System time : 0.002 s
% 0.11/0.34 # Total time : 0.004 s
% 0.11/0.34 # Maximum resident set size: 1684 pages
% 0.11/0.34 % E---3.1 exiting
% 0.11/0.35 % E exiting
%------------------------------------------------------------------------------