TSTP Solution File: SYN951+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SYN951+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 20:27:37 EDT 2023
% Result : Theorem 0.17s 0.45s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 1
% Syntax : Number of formulae : 8 ( 3 unt; 0 def)
% Number of atoms : 26 ( 0 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 29 ( 11 ~; 7 |; 6 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 4 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 8 ( 3 sgn; 1 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_this,conjecture,
( ? [X1] : p(X1)
=> ( ? [X1] : p(X1)
& ( a
=> ( ( b
| ~ b )
& ( q
=> q ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.hprulpDWWU/E---3.1_13035.p',prove_this) ).
fof(c_0_1,negated_conjecture,
~ ( ? [X1] : p(X1)
=> ( ? [X1] : p(X1)
& ( a
=> ( b
| ~ b ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[prove_this])]) ).
fof(c_0_2,negated_conjecture,
! [X3] :
( p(esk1_0)
& ( a
| ~ p(X3) )
& ( ~ b
| ~ p(X3) )
& ( b
| ~ p(X3) ) ),
inference(distribute,[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,
( b
| ~ p(X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
( ~ b
| ~ p(X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5,negated_conjecture,
p(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6,negated_conjecture,
~ p(X1),
inference(csr,[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.03/0.11 % Problem : SYN951+1 : TPTP v8.1.2. Released v3.1.0.
% 0.03/0.12 % Command : run_E %s %d THM
% 0.12/0.32 % Computer : n011.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 2400
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon Oct 2 18:03:53 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.17/0.44 Running first-order theorem proving
% 0.17/0.44 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/tmp/tmp.hprulpDWWU/E---3.1_13035.p
% 0.17/0.45 # Version: 3.1pre001
% 0.17/0.45 # Preprocessing class: FSSSSLSSSSSNFFN.
% 0.17/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.45 # Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 0.17/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.45 # Starting sh5l with 300s (1) cores
% 0.17/0.45 # new_bool_3 with pid 13114 completed with status 0
% 0.17/0.45 # Result found by new_bool_3
% 0.17/0.45 # Preprocessing class: FSSSSLSSSSSNFFN.
% 0.17/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.45 # Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 0.17/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.45 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.45 # Search class: FHHNF-FFSF00-SFFFFFNN
% 0.17/0.45 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.45 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.17/0.45 # SAT001_MinMin_p005000_rr_RG with pid 13120 completed with status 0
% 0.17/0.45 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.17/0.45 # Preprocessing class: FSSSSLSSSSSNFFN.
% 0.17/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.45 # Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 0.17/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.45 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.45 # Search class: FHHNF-FFSF00-SFFFFFNN
% 0.17/0.45 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.45 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.17/0.45 # Preprocessing time : 0.001 s
% 0.17/0.45 # Presaturation interreduction done
% 0.17/0.45
% 0.17/0.45 # Proof found!
% 0.17/0.45 # SZS status Theorem
% 0.17/0.45 # SZS output start CNFRefutation
% See solution above
% 0.17/0.45 # Parsed axioms : 1
% 0.17/0.45 # Removed by relevancy pruning/SinE : 0
% 0.17/0.45 # Initial clauses : 4
% 0.17/0.45 # Removed in clause preprocessing : 0
% 0.17/0.45 # Initial clauses in saturation : 4
% 0.17/0.45 # Processed clauses : 4
% 0.17/0.45 # ...of these trivial : 0
% 0.17/0.45 # ...subsumed : 0
% 0.17/0.45 # ...remaining for further processing : 4
% 0.17/0.45 # Other redundant clauses eliminated : 0
% 0.17/0.45 # Clauses deleted for lack of memory : 0
% 0.17/0.45 # Backward-subsumed : 2
% 0.17/0.45 # Backward-rewritten : 0
% 0.17/0.45 # Generated clauses : 1
% 0.17/0.45 # ...of the previous two non-redundant : 0
% 0.17/0.45 # ...aggressively subsumed : 0
% 0.17/0.45 # Contextual simplify-reflections : 1
% 0.17/0.45 # Paramodulations : 0
% 0.17/0.45 # Factorizations : 0
% 0.17/0.45 # NegExts : 0
% 0.17/0.45 # Equation resolutions : 0
% 0.17/0.45 # Total rewrite steps : 0
% 0.17/0.45 # Propositional unsat checks : 0
% 0.17/0.45 # Propositional check models : 0
% 0.17/0.45 # Propositional check unsatisfiable : 0
% 0.17/0.45 # Propositional clauses : 0
% 0.17/0.45 # Propositional clauses after purity: 0
% 0.17/0.45 # Propositional unsat core size : 0
% 0.17/0.45 # Propositional preprocessing time : 0.000
% 0.17/0.45 # Propositional encoding time : 0.000
% 0.17/0.45 # Propositional solver time : 0.000
% 0.17/0.45 # Success case prop preproc time : 0.000
% 0.17/0.45 # Success case prop encoding time : 0.000
% 0.17/0.45 # Success case prop solver time : 0.000
% 0.17/0.45 # Current number of processed clauses : 1
% 0.17/0.45 # Positive orientable unit clauses : 0
% 0.17/0.45 # Positive unorientable unit clauses: 0
% 0.17/0.45 # Negative unit clauses : 1
% 0.17/0.45 # Non-unit-clauses : 0
% 0.17/0.45 # Current number of unprocessed clauses: 0
% 0.17/0.45 # ...number of literals in the above : 0
% 0.17/0.45 # Current number of archived formulas : 0
% 0.17/0.45 # Current number of archived clauses : 3
% 0.17/0.45 # Clause-clause subsumption calls (NU) : 1
% 0.17/0.45 # Rec. Clause-clause subsumption calls : 1
% 0.17/0.45 # Non-unit clause-clause subsumptions : 1
% 0.17/0.45 # Unit Clause-clause subsumption calls : 2
% 0.17/0.45 # Rewrite failures with RHS unbound : 0
% 0.17/0.45 # BW rewrite match attempts : 0
% 0.17/0.45 # BW rewrite match successes : 0
% 0.17/0.45 # Condensation attempts : 0
% 0.17/0.45 # Condensation successes : 0
% 0.17/0.45 # Termbank termtop insertions : 167
% 0.17/0.45
% 0.17/0.45 # -------------------------------------------------
% 0.17/0.45 # User time : 0.002 s
% 0.17/0.45 # System time : 0.001 s
% 0.17/0.45 # Total time : 0.003 s
% 0.17/0.45 # Maximum resident set size: 1588 pages
% 0.17/0.45
% 0.17/0.45 # -------------------------------------------------
% 0.17/0.45 # User time : 0.003 s
% 0.17/0.45 # System time : 0.002 s
% 0.17/0.45 # Total time : 0.005 s
% 0.17/0.45 # Maximum resident set size: 1664 pages
% 0.17/0.45 % E---3.1 exiting
% 0.17/0.45 % E---3.1 exiting
%------------------------------------------------------------------------------