TSTP Solution File: SYN061+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SYN061+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n021.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:51 EDT 2023
% Result : Theorem 0.11s 0.36s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 18 ( 3 unt; 0 def)
% Number of atoms : 36 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 35 ( 17 ~; 10 |; 6 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 14 ( 0 sgn; 5 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(pel31,conjecture,
? [X1] :
( big_i(X1)
& big_j(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.mx00YoMPFJ/E---3.1_17781.p',pel31) ).
fof(pel31_3,axiom,
! [X1] :
( ~ big_h(X1)
=> big_j(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.mx00YoMPFJ/E---3.1_17781.p',pel31_3) ).
fof(pel31_1,axiom,
~ ? [X1] :
( big_f(X1)
& ( big_g(X1)
| big_h(X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.mx00YoMPFJ/E---3.1_17781.p',pel31_1) ).
fof(pel31_2,axiom,
? [X1] :
( big_i(X1)
& big_f(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.mx00YoMPFJ/E---3.1_17781.p',pel31_2) ).
fof(c_0_4,negated_conjecture,
~ ? [X1] :
( big_i(X1)
& big_j(X1) ),
inference(assume_negation,[status(cth)],[pel31]) ).
fof(c_0_5,plain,
! [X1] :
( ~ big_h(X1)
=> big_j(X1) ),
inference(fof_simplification,[status(thm)],[pel31_3]) ).
fof(c_0_6,negated_conjecture,
! [X5] :
( ~ big_i(X5)
| ~ big_j(X5) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])]) ).
fof(c_0_7,plain,
! [X4] :
( big_h(X4)
| big_j(X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])]) ).
fof(c_0_8,plain,
! [X2] :
( ( ~ big_g(X2)
| ~ big_f(X2) )
& ( ~ big_h(X2)
| ~ big_f(X2) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[pel31_1])])]) ).
cnf(c_0_9,negated_conjecture,
( ~ big_i(X1)
| ~ big_j(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( big_h(X1)
| big_j(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( ~ big_h(X1)
| ~ big_f(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
( big_h(X1)
| ~ big_i(X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
fof(c_0_13,plain,
( big_i(esk1_0)
& big_f(esk1_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[pel31_2])]) ).
cnf(c_0_14,negated_conjecture,
( ~ big_i(X1)
| ~ big_f(X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,plain,
big_i(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_16,plain,
big_f(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : SYN061+1 : TPTP v8.1.2. Released v2.0.0.
% 0.00/0.08 % Command : run_E %s %d THM
% 0.08/0.27 % Computer : n021.cluster.edu
% 0.08/0.27 % Model : x86_64 x86_64
% 0.08/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.27 % Memory : 8042.1875MB
% 0.08/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.27 % CPULimit : 2400
% 0.08/0.27 % WCLimit : 300
% 0.08/0.27 % DateTime : Mon Oct 2 18:20:14 EDT 2023
% 0.08/0.27 % CPUTime :
% 0.11/0.35 Running first-order model finding
% 0.11/0.35 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.mx00YoMPFJ/E---3.1_17781.p
% 0.11/0.36 # Version: 3.1pre001
% 0.11/0.36 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.11/0.36 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.36 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.11/0.36 # Starting new_bool_3 with 300s (1) cores
% 0.11/0.36 # Starting new_bool_1 with 300s (1) cores
% 0.11/0.36 # Starting sh5l with 300s (1) cores
% 0.11/0.36 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 17858 completed with status 0
% 0.11/0.36 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.11/0.36 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.11/0.36 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.36 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.11/0.36 # No SInE strategy applied
% 0.11/0.36 # Search class: FGHNF-FFSF00-SFFFFFNN
% 0.11/0.36 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.36 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.11/0.36 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.11/0.36 # Starting new_bool_3 with 136s (1) cores
% 0.11/0.36 # Starting new_bool_1 with 136s (1) cores
% 0.11/0.36 # Starting sh5l with 136s (1) cores
% 0.11/0.36 # SAT001_MinMin_p005000_rr_RG with pid 17864 completed with status 0
% 0.11/0.36 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.11/0.36 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.11/0.36 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.36 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.11/0.36 # No SInE strategy applied
% 0.11/0.36 # Search class: FGHNF-FFSF00-SFFFFFNN
% 0.11/0.36 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.36 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.11/0.36 # Preprocessing time : 0.001 s
% 0.11/0.36 # Presaturation interreduction done
% 0.11/0.36
% 0.11/0.36 # Proof found!
% 0.11/0.36 # SZS status Theorem
% 0.11/0.36 # SZS output start CNFRefutation
% See solution above
% 0.11/0.36 # Parsed axioms : 4
% 0.11/0.36 # Removed by relevancy pruning/SinE : 0
% 0.11/0.36 # Initial clauses : 6
% 0.11/0.36 # Removed in clause preprocessing : 0
% 0.11/0.36 # Initial clauses in saturation : 6
% 0.11/0.36 # Processed clauses : 14
% 0.11/0.36 # ...of these trivial : 0
% 0.11/0.36 # ...subsumed : 0
% 0.11/0.36 # ...remaining for further processing : 14
% 0.11/0.36 # Other redundant clauses eliminated : 0
% 0.11/0.36 # Clauses deleted for lack of memory : 0
% 0.11/0.36 # Backward-subsumed : 0
% 0.11/0.36 # Backward-rewritten : 0
% 0.11/0.36 # Generated clauses : 3
% 0.11/0.36 # ...of the previous two non-redundant : 2
% 0.11/0.36 # ...aggressively subsumed : 0
% 0.11/0.36 # Contextual simplify-reflections : 0
% 0.11/0.36 # Paramodulations : 3
% 0.11/0.36 # Factorizations : 0
% 0.11/0.36 # NegExts : 0
% 0.11/0.36 # Equation resolutions : 0
% 0.11/0.36 # Total rewrite steps : 1
% 0.11/0.36 # Propositional unsat checks : 0
% 0.11/0.36 # Propositional check models : 0
% 0.11/0.36 # Propositional check unsatisfiable : 0
% 0.11/0.36 # Propositional clauses : 0
% 0.11/0.36 # Propositional clauses after purity: 0
% 0.11/0.36 # Propositional unsat core size : 0
% 0.11/0.36 # Propositional preprocessing time : 0.000
% 0.11/0.36 # Propositional encoding time : 0.000
% 0.11/0.36 # Propositional solver time : 0.000
% 0.11/0.36 # Success case prop preproc time : 0.000
% 0.11/0.36 # Success case prop encoding time : 0.000
% 0.11/0.36 # Success case prop solver time : 0.000
% 0.11/0.36 # Current number of processed clauses : 8
% 0.11/0.36 # Positive orientable unit clauses : 2
% 0.11/0.36 # Positive unorientable unit clauses: 0
% 0.11/0.36 # Negative unit clauses : 0
% 0.11/0.36 # Non-unit-clauses : 6
% 0.11/0.36 # Current number of unprocessed clauses: 0
% 0.11/0.36 # ...number of literals in the above : 0
% 0.11/0.36 # Current number of archived formulas : 0
% 0.11/0.36 # Current number of archived clauses : 6
% 0.11/0.36 # Clause-clause subsumption calls (NU) : 0
% 0.11/0.36 # Rec. Clause-clause subsumption calls : 0
% 0.11/0.36 # Non-unit clause-clause subsumptions : 0
% 0.11/0.36 # Unit Clause-clause subsumption calls : 0
% 0.11/0.36 # Rewrite failures with RHS unbound : 0
% 0.11/0.36 # BW rewrite match attempts : 0
% 0.11/0.36 # BW rewrite match successes : 0
% 0.11/0.36 # Condensation attempts : 0
% 0.11/0.36 # Condensation successes : 0
% 0.11/0.36 # Termbank termtop insertions : 270
% 0.11/0.36
% 0.11/0.36 # -------------------------------------------------
% 0.11/0.36 # User time : 0.002 s
% 0.11/0.36 # System time : 0.001 s
% 0.11/0.36 # Total time : 0.003 s
% 0.11/0.36 # Maximum resident set size: 1672 pages
% 0.11/0.36
% 0.11/0.36 # -------------------------------------------------
% 0.11/0.36 # User time : 0.007 s
% 0.11/0.36 # System time : 0.003 s
% 0.11/0.36 # Total time : 0.010 s
% 0.11/0.36 # Maximum resident set size: 1668 pages
% 0.11/0.36 % E---3.1 exiting
%------------------------------------------------------------------------------