TSTP Solution File: SYN002-1.007.008 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYN002-1.007.008 : TPTP v8.2.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.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:41:34 EDT 2024
% Result : Unsatisfiable 0.21s 0.47s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 2
% Syntax : Number of clauses : 16 ( 4 unt; 2 nHn; 14 RR)
% Number of literals : 28 ( 0 equ; 21 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 9 ( 4 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 0 con; 1-1 aty)
% Number of variables : 15 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(negative,negated_conjecture,
( ~ p(X1)
| ~ p(f(f(f(f(f(f(f(f(X1))))))))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',negative) ).
cnf(positive,negated_conjecture,
( p(X1)
| p(f(f(f(f(f(f(f(X1)))))))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',positive) ).
cnf(c_0_2,negated_conjecture,
( ~ p(X1)
| ~ p(f(f(f(f(f(f(f(f(X1))))))))) ),
inference(fof_simplification,[status(thm)],[negative]) ).
cnf(c_0_3,negated_conjecture,
( ~ p(X1)
| ~ p(f(f(f(f(f(f(f(f(X1))))))))) ),
c_0_2 ).
cnf(c_0_4,negated_conjecture,
( p(X1)
| p(f(f(f(f(f(f(f(X1)))))))) ),
positive ).
cnf(c_0_5,negated_conjecture,
( p(f(X1))
| ~ p(X1) ),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_6,negated_conjecture,
( ~ p(f(f(f(f(f(f(f(X1))))))))
| ~ p(X1) ),
inference(spm,[status(thm)],[c_0_3,c_0_5]) ).
cnf(c_0_7,negated_conjecture,
( ~ p(f(f(f(f(f(f(X1)))))))
| ~ p(X1) ),
inference(spm,[status(thm)],[c_0_6,c_0_5]) ).
cnf(c_0_8,negated_conjecture,
( ~ p(f(f(f(f(f(X1))))))
| ~ p(X1) ),
inference(spm,[status(thm)],[c_0_7,c_0_5]) ).
cnf(c_0_9,negated_conjecture,
( ~ p(f(f(f(f(X1)))))
| ~ p(X1) ),
inference(spm,[status(thm)],[c_0_8,c_0_5]) ).
cnf(c_0_10,negated_conjecture,
( ~ p(f(f(f(X1))))
| ~ p(X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_5]) ).
cnf(c_0_11,negated_conjecture,
( p(X1)
| ~ p(f(f(X1))) ),
inference(spm,[status(thm)],[c_0_8,c_0_4]) ).
cnf(c_0_12,negated_conjecture,
~ p(f(f(X1))),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_5]),c_0_11]) ).
cnf(c_0_13,negated_conjecture,
~ p(f(X1)),
inference(spm,[status(thm)],[c_0_12,c_0_5]) ).
cnf(c_0_14,negated_conjecture,
~ p(X1),
inference(spm,[status(thm)],[c_0_13,c_0_5]) ).
cnf(c_0_15,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_4,c_0_12]),c_0_14]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SYN002-1.007.008 : TPTP v8.2.0. Released v1.0.0.
% 0.04/0.14 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n016.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 : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Mon May 20 14:56:08 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.21/0.46 Running first-order theorem proving
% 0.21/0.46 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/benchmark/theBenchmark.p
% 0.21/0.47 # Version: 3.1.0
% 0.21/0.47 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.47 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.47 # Starting sh5l with 300s (1) cores
% 0.21/0.47 # new_bool_3 with pid 18055 completed with status 0
% 0.21/0.47 # Result found by new_bool_3
% 0.21/0.47 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.47 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.47 # Search class: FGHNF-FFSF11-DFFFFFNN
% 0.21/0.47 # partial match(1): FGHNF-FFSF11-SFFFFFNN
% 0.21/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.47 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.47 # SAT001_MinMin_p005000_rr_RG with pid 18059 completed with status 0
% 0.21/0.47 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.47 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.47 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.47 # Search class: FGHNF-FFSF11-DFFFFFNN
% 0.21/0.47 # partial match(1): FGHNF-FFSF11-SFFFFFNN
% 0.21/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.47 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.47 # Preprocessing time : 0.001 s
% 0.21/0.47 # Presaturation interreduction done
% 0.21/0.47
% 0.21/0.47 # Proof found!
% 0.21/0.47 # SZS status Unsatisfiable
% 0.21/0.47 # SZS output start CNFRefutation
% See solution above
% 0.21/0.47 # Parsed axioms : 2
% 0.21/0.47 # Removed by relevancy pruning/SinE : 0
% 0.21/0.47 # Initial clauses : 2
% 0.21/0.47 # Removed in clause preprocessing : 0
% 0.21/0.47 # Initial clauses in saturation : 2
% 0.21/0.47 # Processed clauses : 17
% 0.21/0.47 # ...of these trivial : 0
% 0.21/0.47 # ...subsumed : 1
% 0.21/0.47 # ...remaining for further processing : 15
% 0.21/0.47 # Other redundant clauses eliminated : 0
% 0.21/0.47 # Clauses deleted for lack of memory : 0
% 0.21/0.47 # Backward-subsumed : 11
% 0.21/0.47 # Backward-rewritten : 0
% 0.21/0.47 # Generated clauses : 19
% 0.21/0.47 # ...of the previous two non-redundant : 17
% 0.21/0.47 # ...aggressively subsumed : 0
% 0.21/0.47 # Contextual simplify-reflections : 1
% 0.21/0.47 # Paramodulations : 18
% 0.21/0.47 # Factorizations : 0
% 0.21/0.47 # NegExts : 0
% 0.21/0.47 # Equation resolutions : 0
% 0.21/0.47 # Disequality decompositions : 0
% 0.21/0.47 # Total rewrite steps : 0
% 0.21/0.47 # ...of those cached : 0
% 0.21/0.47 # Propositional unsat checks : 0
% 0.21/0.47 # Propositional check models : 0
% 0.21/0.47 # Propositional check unsatisfiable : 0
% 0.21/0.47 # Propositional clauses : 0
% 0.21/0.47 # Propositional clauses after purity: 0
% 0.21/0.47 # Propositional unsat core size : 0
% 0.21/0.47 # Propositional preprocessing time : 0.000
% 0.21/0.47 # Propositional encoding time : 0.000
% 0.21/0.47 # Propositional solver time : 0.000
% 0.21/0.47 # Success case prop preproc time : 0.000
% 0.21/0.47 # Success case prop encoding time : 0.000
% 0.21/0.47 # Success case prop solver time : 0.000
% 0.21/0.47 # Current number of processed clauses : 1
% 0.21/0.47 # Positive orientable unit clauses : 0
% 0.21/0.47 # Positive unorientable unit clauses: 0
% 0.21/0.47 # Negative unit clauses : 1
% 0.21/0.47 # Non-unit-clauses : 0
% 0.21/0.47 # Current number of unprocessed clauses: 4
% 0.21/0.47 # ...number of literals in the above : 8
% 0.21/0.47 # Current number of archived formulas : 0
% 0.21/0.47 # Current number of archived clauses : 14
% 0.21/0.47 # Clause-clause subsumption calls (NU) : 29
% 0.21/0.47 # Rec. Clause-clause subsumption calls : 29
% 0.21/0.47 # Non-unit clause-clause subsumptions : 2
% 0.21/0.47 # Unit Clause-clause subsumption calls : 11
% 0.21/0.47 # Rewrite failures with RHS unbound : 0
% 0.21/0.47 # BW rewrite match attempts : 0
% 0.21/0.47 # BW rewrite match successes : 0
% 0.21/0.47 # Condensation attempts : 0
% 0.21/0.47 # Condensation successes : 0
% 0.21/0.47 # Termbank termtop insertions : 402
% 0.21/0.47 # Search garbage collected termcells : 4
% 0.21/0.47
% 0.21/0.47 # -------------------------------------------------
% 0.21/0.47 # User time : 0.003 s
% 0.21/0.47 # System time : 0.000 s
% 0.21/0.47 # Total time : 0.003 s
% 0.21/0.47 # Maximum resident set size: 1656 pages
% 0.21/0.47
% 0.21/0.47 # -------------------------------------------------
% 0.21/0.47 # User time : 0.003 s
% 0.21/0.47 # System time : 0.002 s
% 0.21/0.47 # Total time : 0.005 s
% 0.21/0.47 # Maximum resident set size: 1696 pages
% 0.21/0.47 % E---3.1 exiting
% 0.21/0.47 % E exiting
%------------------------------------------------------------------------------