TSTP Solution File: SYN052+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SYN052+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n013.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:13:18 EDT 2023
% Result : Theorem 0.10s 0.35s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 1
% Syntax : Number of formulae : 10 ( 3 unt; 0 def)
% Number of atoms : 27 ( 0 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 27 ( 10 ~; 8 |; 3 &)
% ( 4 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 2 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 10 ( 4 sgn; 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(pel22,conjecture,
( ! [X1] :
( p
<=> big_f(X1) )
=> ( p
<=> ! [X2] : big_f(X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.XOEw5eZL5I/E---3.1_30520.p',pel22) ).
fof(c_0_1,negated_conjecture,
~ ( ! [X1] :
( p
<=> big_f(X1) )
=> ( p
<=> ! [X2] : big_f(X2) ) ),
inference(assume_negation,[status(cth)],[pel22]) ).
fof(c_0_2,negated_conjecture,
! [X3,X5] :
( ( ~ p
| big_f(X3) )
& ( ~ big_f(X3)
| p )
& ( ~ p
| ~ big_f(esk1_0) )
& ( p
| big_f(X5) ) ),
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,
( p
| big_f(X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
( big_f(X1)
| ~ p ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5,negated_conjecture,
( ~ p
| ~ big_f(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6,negated_conjecture,
big_f(X1),
inference(csr,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_7,negated_conjecture,
( p
| ~ big_f(X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_8,negated_conjecture,
~ p,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_5,c_0_6])]) ).
cnf(c_0_9,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_6])]),c_0_8]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.07 % Problem : SYN052+1 : TPTP v8.1.2. Released v2.0.0.
% 0.03/0.08 % Command : run_E %s %d THM
% 0.07/0.26 % Computer : n013.cluster.edu
% 0.07/0.26 % Model : x86_64 x86_64
% 0.07/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.26 % Memory : 8042.1875MB
% 0.07/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.26 % CPULimit : 2400
% 0.07/0.26 % WCLimit : 300
% 0.07/0.26 % DateTime : Mon Oct 2 18:04:14 EDT 2023
% 0.07/0.27 % CPUTime :
% 0.10/0.34 Running first-order theorem proving
% 0.10/0.34 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.XOEw5eZL5I/E---3.1_30520.p
% 0.10/0.35 # Version: 3.1pre001
% 0.10/0.35 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.10/0.35 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.35 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.10/0.35 # Starting new_bool_3 with 300s (1) cores
% 0.10/0.35 # Starting new_bool_1 with 300s (1) cores
% 0.10/0.35 # Starting sh5l with 300s (1) cores
% 0.10/0.35 # new_bool_3 with pid 30600 completed with status 0
% 0.10/0.35 # Result found by new_bool_3
% 0.10/0.35 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.10/0.35 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.35 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.10/0.35 # Starting new_bool_3 with 300s (1) cores
% 0.10/0.35 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.10/0.35 # Search class: FGHNF-FFSF00-SFFFFFNN
% 0.10/0.35 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.35 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.10/0.35 # SAT001_MinMin_p005000_rr_RG with pid 30604 completed with status 0
% 0.10/0.35 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.10/0.35 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.10/0.35 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.35 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.10/0.35 # Starting new_bool_3 with 300s (1) cores
% 0.10/0.35 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.10/0.35 # Search class: FGHNF-FFSF00-SFFFFFNN
% 0.10/0.35 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.35 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.10/0.35 # Preprocessing time : 0.001 s
% 0.10/0.35 # Presaturation interreduction done
% 0.10/0.35
% 0.10/0.35 # Proof found!
% 0.10/0.35 # SZS status Theorem
% 0.10/0.35 # SZS output start CNFRefutation
% See solution above
% 0.10/0.35 # Parsed axioms : 1
% 0.10/0.35 # Removed by relevancy pruning/SinE : 0
% 0.10/0.35 # Initial clauses : 4
% 0.10/0.35 # Removed in clause preprocessing : 0
% 0.10/0.35 # Initial clauses in saturation : 4
% 0.10/0.35 # Processed clauses : 6
% 0.10/0.35 # ...of these trivial : 0
% 0.10/0.35 # ...subsumed : 0
% 0.10/0.35 # ...remaining for further processing : 5
% 0.10/0.35 # Other redundant clauses eliminated : 0
% 0.10/0.35 # Clauses deleted for lack of memory : 0
% 0.10/0.35 # Backward-subsumed : 1
% 0.10/0.35 # Backward-rewritten : 2
% 0.10/0.35 # Generated clauses : 0
% 0.10/0.35 # ...of the previous two non-redundant : 2
% 0.10/0.35 # ...aggressively subsumed : 0
% 0.10/0.35 # Contextual simplify-reflections : 1
% 0.10/0.35 # Paramodulations : 0
% 0.10/0.35 # Factorizations : 0
% 0.10/0.35 # NegExts : 0
% 0.10/0.35 # Equation resolutions : 0
% 0.10/0.35 # Total rewrite steps : 2
% 0.10/0.35 # Propositional unsat checks : 0
% 0.10/0.35 # Propositional check models : 0
% 0.10/0.35 # Propositional check unsatisfiable : 0
% 0.10/0.35 # Propositional clauses : 0
% 0.10/0.35 # Propositional clauses after purity: 0
% 0.10/0.35 # Propositional unsat core size : 0
% 0.10/0.35 # Propositional preprocessing time : 0.000
% 0.10/0.35 # Propositional encoding time : 0.000
% 0.10/0.35 # Propositional solver time : 0.000
% 0.10/0.35 # Success case prop preproc time : 0.000
% 0.10/0.35 # Success case prop encoding time : 0.000
% 0.10/0.35 # Success case prop solver time : 0.000
% 0.10/0.35 # Current number of processed clauses : 2
% 0.10/0.35 # Positive orientable unit clauses : 1
% 0.10/0.35 # Positive unorientable unit clauses: 0
% 0.10/0.35 # Negative unit clauses : 1
% 0.10/0.35 # Non-unit-clauses : 0
% 0.10/0.35 # Current number of unprocessed clauses: 0
% 0.10/0.35 # ...number of literals in the above : 0
% 0.10/0.35 # Current number of archived formulas : 0
% 0.10/0.35 # Current number of archived clauses : 3
% 0.10/0.35 # Clause-clause subsumption calls (NU) : 1
% 0.10/0.35 # Rec. Clause-clause subsumption calls : 1
% 0.10/0.35 # Non-unit clause-clause subsumptions : 1
% 0.10/0.35 # Unit Clause-clause subsumption calls : 1
% 0.10/0.35 # Rewrite failures with RHS unbound : 0
% 0.10/0.35 # BW rewrite match attempts : 2
% 0.10/0.35 # BW rewrite match successes : 2
% 0.10/0.35 # Condensation attempts : 0
% 0.10/0.35 # Condensation successes : 0
% 0.10/0.35 # Termbank termtop insertions : 220
% 0.10/0.35
% 0.10/0.35 # -------------------------------------------------
% 0.10/0.35 # User time : 0.002 s
% 0.10/0.35 # System time : 0.000 s
% 0.10/0.35 # Total time : 0.002 s
% 0.10/0.35 # Maximum resident set size: 1584 pages
% 0.10/0.35
% 0.10/0.35 # -------------------------------------------------
% 0.10/0.35 # User time : 0.002 s
% 0.10/0.35 # System time : 0.002 s
% 0.10/0.35 # Total time : 0.004 s
% 0.10/0.35 # Maximum resident set size: 1672 pages
% 0.10/0.35 % E---3.1 exiting
% 0.10/0.35 % E---3.1 exiting
%------------------------------------------------------------------------------