TSTP Solution File: HWV009-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : HWV009-1 : TPTP v8.1.2. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n015.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:10 EDT 2023
% Result : Unsatisfiable 0.23s 0.53s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of clauses : 16 ( 6 unt; 3 nHn; 14 RR)
% Number of literals : 29 ( 9 equ; 15 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 8 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(quest_2,negated_conjecture,
( p_Wr_error(plus(t_139,n1))
| p_Rd_error(plus(t_139,n1))
| level(plus(t_139,n1)) != n0 ),
file('/export/starexec/sandbox/tmp/tmp.EUXurts6fL/E---3.1_7183.p',quest_2) ).
cnf(axiom_21,axiom,
level(X1) = int_level(X1),
file('/export/starexec/sandbox/tmp/tmp.EUXurts6fL/E---3.1_7183.p',axiom_21) ).
cnf(axiom_29,axiom,
( ~ p_Reset(X1)
| ~ p_Wr_error(plus(X1,n1)) ),
file('/export/starexec/sandbox/tmp/tmp.EUXurts6fL/E---3.1_7183.p',axiom_29) ).
cnf(quest_1,negated_conjecture,
p_Reset(t_139),
file('/export/starexec/sandbox/tmp/tmp.EUXurts6fL/E---3.1_7183.p',quest_1) ).
cnf(axiom_30,axiom,
( ~ p_Reset(X1)
| ~ p_Rd_error(plus(X1,n1)) ),
file('/export/starexec/sandbox/tmp/tmp.EUXurts6fL/E---3.1_7183.p',axiom_30) ).
cnf(axiom_26,axiom,
( int_level(plus(X1,n1)) = n0
| ~ p_Reset(X1) ),
file('/export/starexec/sandbox/tmp/tmp.EUXurts6fL/E---3.1_7183.p',axiom_26) ).
cnf(c_0_6,negated_conjecture,
( p_Wr_error(plus(t_139,n1))
| p_Rd_error(plus(t_139,n1))
| level(plus(t_139,n1)) != n0 ),
quest_2 ).
cnf(c_0_7,axiom,
level(X1) = int_level(X1),
axiom_21 ).
cnf(c_0_8,axiom,
( ~ p_Reset(X1)
| ~ p_Wr_error(plus(X1,n1)) ),
axiom_29 ).
cnf(c_0_9,negated_conjecture,
( p_Rd_error(plus(t_139,n1))
| p_Wr_error(plus(t_139,n1))
| int_level(plus(t_139,n1)) != n0 ),
inference(rw,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,negated_conjecture,
p_Reset(t_139),
quest_1 ).
cnf(c_0_11,axiom,
( ~ p_Reset(X1)
| ~ p_Rd_error(plus(X1,n1)) ),
axiom_30 ).
cnf(c_0_12,negated_conjecture,
( p_Rd_error(plus(t_139,n1))
| int_level(plus(t_139,n1)) != n0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10])]) ).
cnf(c_0_13,negated_conjecture,
int_level(plus(t_139,n1)) != n0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_10])]) ).
cnf(c_0_14,axiom,
( int_level(plus(X1,n1)) = n0
| ~ p_Reset(X1) ),
axiom_26 ).
cnf(c_0_15,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_10])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : HWV009-1 : TPTP v8.1.2. Released v2.5.0.
% 0.14/0.15 % Command : run_E %s %d THM
% 0.14/0.37 % Computer : n015.cluster.edu
% 0.14/0.37 % Model : x86_64 x86_64
% 0.14/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37 % Memory : 8042.1875MB
% 0.14/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37 % CPULimit : 2400
% 0.14/0.37 % WCLimit : 300
% 0.14/0.37 % DateTime : Tue Oct 3 06:11:31 EDT 2023
% 0.14/0.37 % CPUTime :
% 0.23/0.51 Running first-order theorem proving
% 0.23/0.51 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.EUXurts6fL/E---3.1_7183.p
% 0.23/0.53 # Version: 3.1pre001
% 0.23/0.53 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.23/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.23/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.53 # Starting sh5l with 300s (1) cores
% 0.23/0.53 # new_bool_1 with pid 7263 completed with status 0
% 0.23/0.53 # Result found by new_bool_1
% 0.23/0.53 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.23/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.23/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.53 # Search class: FGHSS-FFMF21-SFFFFFNN
% 0.23/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.53 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.23/0.53 # SAT001_MinMin_p005000_rr_RG with pid 7266 completed with status 0
% 0.23/0.53 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.23/0.53 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.23/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.23/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.53 # Search class: FGHSS-FFMF21-SFFFFFNN
% 0.23/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.53 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.23/0.53 # Preprocessing time : 0.002 s
% 0.23/0.53 # Presaturation interreduction done
% 0.23/0.53
% 0.23/0.53 # Proof found!
% 0.23/0.53 # SZS status Unsatisfiable
% 0.23/0.53 # SZS output start CNFRefutation
% See solution above
% 0.23/0.53 # Parsed axioms : 92
% 0.23/0.53 # Removed by relevancy pruning/SinE : 33
% 0.23/0.53 # Initial clauses : 59
% 0.23/0.53 # Removed in clause preprocessing : 0
% 0.23/0.53 # Initial clauses in saturation : 59
% 0.23/0.53 # Processed clauses : 81
% 0.23/0.53 # ...of these trivial : 0
% 0.23/0.53 # ...subsumed : 1
% 0.23/0.53 # ...remaining for further processing : 80
% 0.23/0.53 # Other redundant clauses eliminated : 0
% 0.23/0.53 # Clauses deleted for lack of memory : 0
% 0.23/0.53 # Backward-subsumed : 10
% 0.23/0.53 # Backward-rewritten : 2
% 0.23/0.53 # Generated clauses : 10
% 0.23/0.53 # ...of the previous two non-redundant : 9
% 0.23/0.53 # ...aggressively subsumed : 0
% 0.23/0.53 # Contextual simplify-reflections : 35
% 0.23/0.53 # Paramodulations : 10
% 0.23/0.53 # Factorizations : 0
% 0.23/0.53 # NegExts : 0
% 0.23/0.53 # Equation resolutions : 0
% 0.23/0.53 # Total rewrite steps : 5
% 0.23/0.53 # Propositional unsat checks : 0
% 0.23/0.53 # Propositional check models : 0
% 0.23/0.53 # Propositional check unsatisfiable : 0
% 0.23/0.53 # Propositional clauses : 0
% 0.23/0.53 # Propositional clauses after purity: 0
% 0.23/0.53 # Propositional unsat core size : 0
% 0.23/0.53 # Propositional preprocessing time : 0.000
% 0.23/0.53 # Propositional encoding time : 0.000
% 0.23/0.53 # Propositional solver time : 0.000
% 0.23/0.53 # Success case prop preproc time : 0.000
% 0.23/0.53 # Success case prop encoding time : 0.000
% 0.23/0.53 # Success case prop solver time : 0.000
% 0.23/0.53 # Current number of processed clauses : 19
% 0.23/0.53 # Positive orientable unit clauses : 5
% 0.23/0.53 # Positive unorientable unit clauses: 0
% 0.23/0.53 # Negative unit clauses : 4
% 0.23/0.53 # Non-unit-clauses : 10
% 0.23/0.53 # Current number of unprocessed clauses: 36
% 0.23/0.53 # ...number of literals in the above : 134
% 0.23/0.53 # Current number of archived formulas : 0
% 0.23/0.53 # Current number of archived clauses : 61
% 0.23/0.53 # Clause-clause subsumption calls (NU) : 700
% 0.23/0.53 # Rec. Clause-clause subsumption calls : 160
% 0.23/0.53 # Non-unit clause-clause subsumptions : 45
% 0.23/0.53 # Unit Clause-clause subsumption calls : 2
% 0.23/0.53 # Rewrite failures with RHS unbound : 0
% 0.23/0.53 # BW rewrite match attempts : 2
% 0.23/0.53 # BW rewrite match successes : 2
% 0.23/0.53 # Condensation attempts : 0
% 0.23/0.53 # Condensation successes : 0
% 0.23/0.53 # Termbank termtop insertions : 3134
% 0.23/0.53
% 0.23/0.53 # -------------------------------------------------
% 0.23/0.53 # User time : 0.008 s
% 0.23/0.53 # System time : 0.001 s
% 0.23/0.53 # Total time : 0.010 s
% 0.23/0.53 # Maximum resident set size: 1796 pages
% 0.23/0.53
% 0.23/0.53 # -------------------------------------------------
% 0.23/0.53 # User time : 0.011 s
% 0.23/0.53 # System time : 0.004 s
% 0.23/0.53 # Total time : 0.015 s
% 0.23/0.53 # Maximum resident set size: 1736 pages
% 0.23/0.53 % E---3.1 exiting
% 0.23/0.54 % E---3.1 exiting
%------------------------------------------------------------------------------