TSTP Solution File: SYN051+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SYN051+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:28:48 EDT 2023
% Result : Timeout 0.36s 300.12s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 15 ( 4 unt; 0 def)
% Number of atoms : 28 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 24 ( 11 ~; 8 |; 1 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 2 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 8 ( 3 sgn; 1 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(pel21,conjecture,
? [X1] :
( p
<=> big_f(X1) ),
file('/export/starexec/sandbox/tmp/tmp.XaVL3GgdNF/E---3.1_9924.p',pel21) ).
fof(pel21_2,axiom,
? [X1] :
( big_f(X1)
=> p ),
file('/export/starexec/sandbox/tmp/tmp.XaVL3GgdNF/E---3.1_9924.p',pel21_2) ).
fof(pel21_1,axiom,
? [X1] :
( p
=> big_f(X1) ),
file('/export/starexec/sandbox/tmp/tmp.XaVL3GgdNF/E---3.1_9924.p',pel21_1) ).
fof(c_0_3,negated_conjecture,
~ ? [X1] :
( p
<=> big_f(X1) ),
inference(assume_negation,[status(cth)],[pel21]) ).
fof(c_0_4,plain,
( ~ big_f(esk2_0)
| p ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[pel21_2])])]) ).
fof(c_0_5,negated_conjecture,
! [X2] :
( ( ~ p
| ~ big_f(X2) )
& ( p
| big_f(X2) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])]) ).
cnf(c_0_6,plain,
( p
| ~ big_f(esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
( ~ p
| ~ big_f(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
~ big_f(esk2_0),
inference(csr,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,negated_conjecture,
( p
| big_f(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_10,plain,
( ~ p
| big_f(esk1_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[pel21_1])])]) ).
cnf(c_0_11,negated_conjecture,
p,
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,plain,
( big_f(esk1_0)
| ~ p ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,negated_conjecture,
~ big_f(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_11])]) ).
cnf(c_0_14,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_11])]),c_0_13]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SYN051+1 : TPTP v8.1.2. Released v2.0.0.
% 0.07/0.15 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n013.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 2400
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Mon Oct 2 18:32:29 EDT 2023
% 0.14/0.37 % CPUTime :
% 0.22/0.51 Running first-order model finding
% 0.22/0.51 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/tmp/tmp.XaVL3GgdNF/E---3.1_9924.p
% 0.36/300.12 # Version: 3.1pre001
% 0.36/300.12 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.36/300.12 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.36/300.12 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.36/300.12 # Starting new_bool_3 with 300s (1) cores
% 0.36/300.12 # Starting new_bool_1 with 300s (1) cores
% 0.36/300.12 # Starting sh5l with 300s (1) cores
% 0.36/300.12 # sh5l with pid 10015 completed with status 0
% 0.36/300.12 # Result found by sh5l
% 0.36/300.12 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.36/300.12 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.36/300.12 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.36/300.12 # Starting new_bool_3 with 300s (1) cores
% 0.36/300.12 # Starting new_bool_1 with 300s (1) cores
% 0.36/300.12 # Starting sh5l with 300s (1) cores
% 0.36/300.12 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.36/300.12 # Search class: FGHNF-FFSF00-SFFFFFNN
% 0.36/300.12 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.36/300.12 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.36/300.12 # SAT001_MinMin_p005000_rr_RG with pid 10016 completed with status 0
% 0.36/300.12 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.36/300.12 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.36/300.12 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.36/300.12 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.36/300.12 # Starting new_bool_3 with 300s (1) cores
% 0.36/300.12 # Starting new_bool_1 with 300s (1) cores
% 0.36/300.12 # Starting sh5l with 300s (1) cores
% 0.36/300.12 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.36/300.12 # Search class: FGHNF-FFSF00-SFFFFFNN
% 0.36/300.12 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.36/300.12 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.36/300.12 # Preprocessing time : 0.001 s
% 0.36/300.12 # Presaturation interreduction done
% 0.36/300.12
% 0.36/300.12 # Proof found!
% 0.36/300.12 # SZS status Theorem
% 0.36/300.12 # SZS output start CNFRefutation
% See solution above
% 0.36/300.12 # Parsed axioms : 3
% 0.36/300.12 # Removed by relevancy pruning/SinE : 0
% 0.36/300.12 # Initial clauses : 4
% 0.36/300.12 # Removed in clause preprocessing : 0
% 0.36/300.12 # Initial clauses in saturation : 4
% 0.36/300.12 # Processed clauses : 10
% 0.36/300.12 # ...of these trivial : 0
% 0.36/300.12 # ...subsumed : 0
% 0.36/300.12 # ...remaining for further processing : 9
% 0.36/300.12 # Other redundant clauses eliminated : 0
% 0.36/300.12 # Clauses deleted for lack of memory : 0
% 0.36/300.12 # Backward-subsumed : 1
% 0.36/300.12 # Backward-rewritten : 2
% 0.36/300.12 # Generated clauses : 1
% 0.36/300.12 # ...of the previous two non-redundant : 2
% 0.36/300.12 # ...aggressively subsumed : 0
% 0.36/300.12 # Contextual simplify-reflections : 1
% 0.36/300.12 # Paramodulations : 1
% 0.36/300.12 # Factorizations : 0
% 0.36/300.12 # NegExts : 0
% 0.36/300.12 # Equation resolutions : 0
% 0.36/300.12 # Total rewrite steps : 3
% 0.36/300.12 # Propositional unsat checks : 0
% 0.36/300.12 # Propositional check models : 0
% 0.36/300.12 # Propositional check unsatisfiable : 0
% 0.36/300.12 # Propositional clauses : 0
% 0.36/300.12 # Propositional clauses after purity: 0
% 0.36/300.12 # Propositional unsat core size : 0
% 0.36/300.12 # Propositional preprocessing time : 0.000
% 0.36/300.12 # Propositional encoding time : 0.000
% 0.36/300.12 # Propositional solver time : 0.000
% 0.36/300.12 # Success case prop preproc time : 0.000
% 0.36/300.12 # Success case prop encoding time : 0.000
% 0.36/300.12 # Success case prop solver time : 0.000
% 0.36/300.12 # Current number of processed clauses : 2
% 0.36/300.12 # Positive orientable unit clauses : 1
% 0.36/300.12 # Positive unorientable unit clauses: 0
% 0.36/300.12 # Negative unit clauses : 1
% 0.36/300.12 # Non-unit-clauses : 0
% 0.36/300.12 # Current number of unprocessed clauses: 0
% 0.36/300.12 # ...number of literals in the above : 0
% 0.36/300.12 # Current number of archived formulas : 0
% 0.36/300.12 # Current number of archived clauses : 7
% 0.36/300.12 # Clause-clause subsumption calls (NU) : 1
% 0.36/300.12 # Rec. Clause-clause subsumption calls : 1
% 0.36/300.12 # Non-unit clause-clause subsumptions : 1
% 0.36/300.12 # Unit Clause-clause subsumption calls : 1
% 0.36/300.12 # Rewrite failures with RHS unbound : 0
% 0.36/300.12 # BW rewrite match attempts : 1
% 0.36/300.12 # BW rewrite match successes : 1
% 0.36/300.12 # Condensation attempts : 0
% 0.36/300.12 # Condensation successes : 0
% 0.36/300.12 # Termbank termtop insertions : 175
% 0.36/300.12
% 0.36/300.12 # -------------------------------------------------
% 0.36/300.12 # User time : 0.002 s
% 0.36/300.12 # System time : 0.002 s
% 0.36/300.12 # Total time : 0.004 s
% 0.36/300.12 # Maximum resident set size: 1600 pages
% 0.36/300.12
% 0.36/300.12 # -------------------------------------------------
% 0.36/300.12 # User time : 0.003 s
% 0.36/300.12 # System time : 0.004 s
% 0.36/300.12 # Total time : 0.007 s
% 0.36/300.12 # Maximum resident set size: 1676 pages
% 0.36/300.12 % E---3.1 exiting
%------------------------------------------------------------------------------