TSTP Solution File: HWV012-2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : HWV012-2 : TPTP v8.1.2. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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 17:51:11 EDT 2023
% Result : Unsatisfiable 0.40s 0.59s
% Output : CNFRefutation 0.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of clauses : 18 ( 10 unt; 2 nHn; 16 RR)
% Number of literals : 38 ( 2 equ; 22 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 3 con; 0-2 aty)
% Number of variables : 10 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(axiom_41,axiom,
( p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(X1))
| ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr__error_(f_ADD_(X1,n1)))
| ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(X1))
| ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(X1)) ),
file('/export/starexec/sandbox/tmp/tmp.q6wR37kQHN/E---3.1_25807.p',axiom_41) ).
cnf(axiom_13,axiom,
( ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr__error_(f_ADD_(X1,n1)))
| ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(X1)) ),
file('/export/starexec/sandbox/tmp/tmp.q6wR37kQHN/E---3.1_25807.p',axiom_13) ).
cnf(axiom_22,axiom,
( p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTfifo__length_,fwork_DOTfifo_DOTrtl_DOTint__level_(X1))
| p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(X1))
| p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(X1))
| ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr__error_(f_ADD_(X1,n1)))
| ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(X1)) ),
file('/export/starexec/sandbox/tmp/tmp.q6wR37kQHN/E---3.1_25807.p',axiom_22) ).
cnf(quest_1,negated_conjecture,
~ p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTfifo__length_,fwork_DOTfifo_DOTrtl_DOTlevel_(t_206)),
file('/export/starexec/sandbox/tmp/tmp.q6wR37kQHN/E---3.1_25807.p',quest_1) ).
cnf(axiom_5,axiom,
fwork_DOTfifo_DOTrtl_DOTlevel_(X1) = fwork_DOTfifo_DOTrtl_DOTint__level_(X1),
file('/export/starexec/sandbox/tmp/tmp.q6wR37kQHN/E---3.1_25807.p',axiom_5) ).
cnf(quest_3,negated_conjecture,
p__pred_(fwork_DOTfifo_DOTrtl_DOTwr__error_(f_ADD_(t_206,n1))),
file('/export/starexec/sandbox/tmp/tmp.q6wR37kQHN/E---3.1_25807.p',quest_3) ).
cnf(quest_2,negated_conjecture,
p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(t_206)),
file('/export/starexec/sandbox/tmp/tmp.q6wR37kQHN/E---3.1_25807.p',quest_2) ).
cnf(c_0_7,axiom,
( p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(X1))
| ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr__error_(f_ADD_(X1,n1)))
| ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(X1))
| ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(X1)) ),
axiom_41 ).
cnf(c_0_8,axiom,
( ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr__error_(f_ADD_(X1,n1)))
| ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(X1)) ),
axiom_13 ).
cnf(c_0_9,axiom,
( p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTfifo__length_,fwork_DOTfifo_DOTrtl_DOTint__level_(X1))
| p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(X1))
| p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(X1))
| ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr__error_(f_ADD_(X1,n1)))
| ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(X1)) ),
axiom_22 ).
cnf(c_0_10,plain,
( ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr__error_(f_ADD_(X1,n1)))
| ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTrd_(X1))
| ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(X1)) ),
inference(csr,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,negated_conjecture,
~ p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTfifo__length_,fwork_DOTfifo_DOTrtl_DOTlevel_(t_206)),
quest_1 ).
cnf(c_0_12,axiom,
fwork_DOTfifo_DOTrtl_DOTlevel_(X1) = fwork_DOTfifo_DOTrtl_DOTint__level_(X1),
axiom_5 ).
cnf(c_0_13,plain,
( p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTfifo__length_,fwork_DOTfifo_DOTrtl_DOTint__level_(X1))
| ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr__error_(f_ADD_(X1,n1)))
| ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(X1)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_9,c_0_10]),c_0_8]) ).
cnf(c_0_14,negated_conjecture,
p__pred_(fwork_DOTfifo_DOTrtl_DOTwr__error_(f_ADD_(t_206,n1))),
quest_3 ).
cnf(c_0_15,negated_conjecture,
p__pred_(fwork_DOTfifo_DOTrtl_DOTwr_(t_206)),
quest_2 ).
cnf(c_0_16,negated_conjecture,
~ p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTfifo__length_,fwork_DOTfifo_DOTrtl_DOTint__level_(t_206)),
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]),c_0_16]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.16 % Problem : HWV012-2 : TPTP v8.1.2. Released v2.5.0.
% 0.13/0.17 % Command : run_E %s %d THM
% 0.16/0.39 % Computer : n029.cluster.edu
% 0.16/0.39 % Model : x86_64 x86_64
% 0.16/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.39 % Memory : 8042.1875MB
% 0.16/0.39 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.39 % CPULimit : 2400
% 0.16/0.39 % WCLimit : 300
% 0.16/0.39 % DateTime : Tue Oct 3 06:01:37 EDT 2023
% 0.16/0.39 % CPUTime :
% 0.39/0.55 Running first-order theorem proving
% 0.39/0.55 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/tmp/tmp.q6wR37kQHN/E---3.1_25807.p
% 0.40/0.59 # Version: 3.1pre001
% 0.40/0.59 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.40/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.40/0.59 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.40/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.40/0.59 # Starting new_bool_1 with 300s (1) cores
% 0.40/0.59 # Starting sh5l with 300s (1) cores
% 0.40/0.59 # new_bool_3 with pid 25886 completed with status 0
% 0.40/0.59 # Result found by new_bool_3
% 0.40/0.59 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.40/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.40/0.59 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.40/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.40/0.59 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.40/0.59 # Search class: FGHSS-FFMS21-SFFFFFNN
% 0.40/0.59 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.40/0.59 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.40/0.59 # SAT001_MinMin_p005000_rr_RG with pid 25889 completed with status 0
% 0.40/0.59 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.40/0.59 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.40/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.40/0.59 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.40/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.40/0.59 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.40/0.59 # Search class: FGHSS-FFMS21-SFFFFFNN
% 0.40/0.59 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.40/0.59 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.40/0.59 # Preprocessing time : 0.004 s
% 0.40/0.59 # Presaturation interreduction done
% 0.40/0.59
% 0.40/0.59 # Proof found!
% 0.40/0.59 # SZS status Unsatisfiable
% 0.40/0.59 # SZS output start CNFRefutation
% See solution above
% 0.40/0.59 # Parsed axioms : 136
% 0.40/0.59 # Removed by relevancy pruning/SinE : 103
% 0.40/0.59 # Initial clauses : 33
% 0.40/0.59 # Removed in clause preprocessing : 0
% 0.40/0.59 # Initial clauses in saturation : 33
% 0.40/0.59 # Processed clauses : 63
% 0.40/0.59 # ...of these trivial : 0
% 0.40/0.59 # ...subsumed : 2
% 0.40/0.59 # ...remaining for further processing : 61
% 0.40/0.59 # Other redundant clauses eliminated : 0
% 0.40/0.59 # Clauses deleted for lack of memory : 0
% 0.40/0.59 # Backward-subsumed : 0
% 0.40/0.59 # Backward-rewritten : 2
% 0.40/0.59 # Generated clauses : 18
% 0.40/0.59 # ...of the previous two non-redundant : 14
% 0.40/0.59 # ...aggressively subsumed : 0
% 0.40/0.59 # Contextual simplify-reflections : 6
% 0.40/0.59 # Paramodulations : 17
% 0.40/0.59 # Factorizations : 0
% 0.40/0.59 # NegExts : 0
% 0.40/0.59 # Equation resolutions : 1
% 0.40/0.59 # Total rewrite steps : 8
% 0.40/0.59 # Propositional unsat checks : 0
% 0.40/0.59 # Propositional check models : 0
% 0.40/0.59 # Propositional check unsatisfiable : 0
% 0.40/0.59 # Propositional clauses : 0
% 0.40/0.59 # Propositional clauses after purity: 0
% 0.40/0.59 # Propositional unsat core size : 0
% 0.40/0.59 # Propositional preprocessing time : 0.000
% 0.40/0.59 # Propositional encoding time : 0.000
% 0.40/0.59 # Propositional solver time : 0.000
% 0.40/0.59 # Success case prop preproc time : 0.000
% 0.40/0.59 # Success case prop encoding time : 0.000
% 0.40/0.59 # Success case prop solver time : 0.000
% 0.40/0.59 # Current number of processed clauses : 28
% 0.40/0.59 # Positive orientable unit clauses : 5
% 0.40/0.59 # Positive unorientable unit clauses: 0
% 0.40/0.59 # Negative unit clauses : 7
% 0.40/0.59 # Non-unit-clauses : 16
% 0.40/0.59 # Current number of unprocessed clauses: 14
% 0.40/0.59 # ...number of literals in the above : 54
% 0.40/0.59 # Current number of archived formulas : 0
% 0.40/0.59 # Current number of archived clauses : 33
% 0.40/0.59 # Clause-clause subsumption calls (NU) : 83
% 0.40/0.59 # Rec. Clause-clause subsumption calls : 44
% 0.40/0.59 # Non-unit clause-clause subsumptions : 8
% 0.40/0.59 # Unit Clause-clause subsumption calls : 7
% 0.40/0.59 # Rewrite failures with RHS unbound : 0
% 0.40/0.59 # BW rewrite match attempts : 3
% 0.40/0.59 # BW rewrite match successes : 2
% 0.40/0.59 # Condensation attempts : 0
% 0.40/0.59 # Condensation successes : 0
% 0.40/0.59 # Termbank termtop insertions : 2875
% 0.40/0.59
% 0.40/0.59 # -------------------------------------------------
% 0.40/0.59 # User time : 0.007 s
% 0.40/0.59 # System time : 0.003 s
% 0.40/0.59 # Total time : 0.010 s
% 0.40/0.59 # Maximum resident set size: 1840 pages
% 0.40/0.59
% 0.40/0.59 # -------------------------------------------------
% 0.40/0.59 # User time : 0.010 s
% 0.40/0.59 # System time : 0.006 s
% 0.40/0.59 # Total time : 0.017 s
% 0.40/0.59 # Maximum resident set size: 1780 pages
% 0.40/0.59 % E---3.1 exiting
% 0.40/0.59 % E---3.1 exiting
%------------------------------------------------------------------------------