TSTP Solution File: SYN008-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYN008-1 : TPTP v8.2.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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:45 EDT 2024
% Result : Unsatisfiable 0.12s 0.35s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 12 ( 9 unt; 3 nHn; 12 RR)
% Number of literals : 18 ( 0 equ; 9 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of predicates : 4 ( 3 usr; 4 prp; 0-0 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause_6,negated_conjecture,
( p
| q
| ~ r ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_6) ).
cnf(clause_1,negated_conjecture,
~ p,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_1) ).
cnf(clause_2,negated_conjecture,
~ q,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_2) ).
cnf(clause_3,negated_conjecture,
r,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_3) ).
cnf(c_0_4,negated_conjecture,
( p
| q
| ~ r ),
inference(fof_simplification,[status(thm)],[clause_6]) ).
cnf(c_0_5,negated_conjecture,
~ p,
inference(fof_simplification,[status(thm)],[clause_1]) ).
cnf(c_0_6,negated_conjecture,
~ q,
inference(fof_simplification,[status(thm)],[clause_2]) ).
cnf(c_0_7,negated_conjecture,
( p
| q
| ~ r ),
c_0_4 ).
cnf(c_0_8,negated_conjecture,
r,
clause_3 ).
cnf(c_0_9,negated_conjecture,
~ p,
c_0_5 ).
cnf(c_0_10,negated_conjecture,
~ q,
c_0_6 ).
cnf(c_0_11,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8])]),c_0_9]),c_0_10]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.01/0.07 % Problem : SYN008-1 : TPTP v8.2.0. Released v1.0.0.
% 0.01/0.08 % Command : run_E %s %d THM
% 0.09/0.26 % Computer : n006.cluster.edu
% 0.09/0.26 % Model : x86_64 x86_64
% 0.09/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.26 % Memory : 8042.1875MB
% 0.09/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.26 % CPULimit : 300
% 0.09/0.26 % WCLimit : 300
% 0.09/0.26 % DateTime : Mon May 20 15:42:37 EDT 2024
% 0.09/0.26 % CPUTime :
% 0.12/0.34 Running first-order theorem proving
% 0.12/0.34 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.12/0.35 # Version: 3.1.0
% 0.12/0.35 # Preprocessing class: FSSSSLSSSSSNFFN.
% 0.12/0.35 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.35 # Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 0.12/0.35 # Starting new_bool_3 with 300s (1) cores
% 0.12/0.35 # Starting new_bool_1 with 300s (1) cores
% 0.12/0.35 # Starting sh5l with 300s (1) cores
% 0.12/0.35 # new_bool_1 with pid 13917 completed with status 0
% 0.12/0.35 # Result found by new_bool_1
% 0.12/0.35 # Preprocessing class: FSSSSLSSSSSNFFN.
% 0.12/0.35 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.35 # Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 0.12/0.35 # Starting new_bool_3 with 300s (1) cores
% 0.12/0.35 # Starting new_bool_1 with 300s (1) cores
% 0.12/0.35 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.35 # Search class: FGUNF-FFSF00-SFFFFFNN
% 0.12/0.35 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.35 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.12/0.35 # SAT001_MinMin_p005000_rr_RG with pid 13923 completed with status 0
% 0.12/0.35 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.12/0.35 # Preprocessing class: FSSSSLSSSSSNFFN.
% 0.12/0.35 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.35 # Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 0.12/0.35 # Starting new_bool_3 with 300s (1) cores
% 0.12/0.35 # Starting new_bool_1 with 300s (1) cores
% 0.12/0.35 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.35 # Search class: FGUNF-FFSF00-SFFFFFNN
% 0.12/0.35 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.35 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.12/0.35 # Preprocessing time : 0.001 s
% 0.12/0.35 # Presaturation interreduction done
% 0.12/0.35
% 0.12/0.35 # Proof found!
% 0.12/0.35 # SZS status Unsatisfiable
% 0.12/0.35 # SZS output start CNFRefutation
% See solution above
% 0.12/0.35 # Parsed axioms : 6
% 0.12/0.35 # Removed by relevancy pruning/SinE : 0
% 0.12/0.35 # Initial clauses : 6
% 0.12/0.35 # Removed in clause preprocessing : 0
% 0.12/0.35 # Initial clauses in saturation : 6
% 0.12/0.35 # Processed clauses : 4
% 0.12/0.35 # ...of these trivial : 0
% 0.12/0.35 # ...subsumed : 0
% 0.12/0.35 # ...remaining for further processing : 3
% 0.12/0.35 # Other redundant clauses eliminated : 0
% 0.12/0.35 # Clauses deleted for lack of memory : 0
% 0.12/0.35 # Backward-subsumed : 0
% 0.12/0.35 # Backward-rewritten : 0
% 0.12/0.35 # Generated clauses : 0
% 0.12/0.35 # ...of the previous two non-redundant : 0
% 0.12/0.35 # ...aggressively subsumed : 0
% 0.12/0.35 # Contextual simplify-reflections : 0
% 0.12/0.35 # Paramodulations : 0
% 0.12/0.35 # Factorizations : 0
% 0.12/0.35 # NegExts : 0
% 0.12/0.35 # Equation resolutions : 0
% 0.12/0.35 # Disequality decompositions : 0
% 0.12/0.35 # Total rewrite steps : 1
% 0.12/0.35 # ...of those cached : 0
% 0.12/0.35 # Propositional unsat checks : 0
% 0.12/0.35 # Propositional check models : 0
% 0.12/0.35 # Propositional check unsatisfiable : 0
% 0.12/0.35 # Propositional clauses : 0
% 0.12/0.35 # Propositional clauses after purity: 0
% 0.12/0.35 # Propositional unsat core size : 0
% 0.12/0.35 # Propositional preprocessing time : 0.000
% 0.12/0.35 # Propositional encoding time : 0.000
% 0.12/0.35 # Propositional solver time : 0.000
% 0.12/0.35 # Success case prop preproc time : 0.000
% 0.12/0.35 # Success case prop encoding time : 0.000
% 0.12/0.35 # Success case prop solver time : 0.000
% 0.12/0.35 # Current number of processed clauses : 3
% 0.12/0.35 # Positive orientable unit clauses : 1
% 0.12/0.35 # Positive unorientable unit clauses: 0
% 0.12/0.35 # Negative unit clauses : 2
% 0.12/0.35 # Non-unit-clauses : 0
% 0.12/0.35 # Current number of unprocessed clauses: 2
% 0.12/0.35 # ...number of literals in the above : 7
% 0.12/0.35 # Current number of archived formulas : 0
% 0.12/0.35 # Current number of archived clauses : 0
% 0.12/0.35 # Clause-clause subsumption calls (NU) : 0
% 0.12/0.35 # Rec. Clause-clause subsumption calls : 0
% 0.12/0.35 # Non-unit clause-clause subsumptions : 0
% 0.12/0.35 # Unit Clause-clause subsumption calls : 0
% 0.12/0.35 # Rewrite failures with RHS unbound : 0
% 0.12/0.35 # BW rewrite match attempts : 0
% 0.12/0.35 # BW rewrite match successes : 0
% 0.12/0.35 # Condensation attempts : 0
% 0.12/0.35 # Condensation successes : 0
% 0.12/0.35 # Termbank termtop insertions : 89
% 0.12/0.35 # Search garbage collected termcells : 6
% 0.12/0.35
% 0.12/0.35 # -------------------------------------------------
% 0.12/0.35 # User time : 0.001 s
% 0.12/0.35 # System time : 0.001 s
% 0.12/0.35 # Total time : 0.002 s
% 0.12/0.35 # Maximum resident set size: 1636 pages
% 0.12/0.35
% 0.12/0.35 # -------------------------------------------------
% 0.12/0.35 # User time : 0.001 s
% 0.12/0.35 # System time : 0.003 s
% 0.12/0.35 # Total time : 0.004 s
% 0.12/0.35 # Maximum resident set size: 1676 pages
% 0.12/0.35 % E---3.1 exiting
% 0.12/0.35 % E exiting
%------------------------------------------------------------------------------