TSTP Solution File: HWV023-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : HWV023-1 : TPTP v8.2.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n024.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 : Mon May 20 21:36:58 EDT 2024
% Result : Unsatisfiable 0.20s 0.52s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 12
% Syntax : Number of clauses : 39 ( 24 unt; 8 nHn; 31 RR)
% Number of literals : 69 ( 26 equ; 31 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 33 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(axiom_5,axiom,
( minus(X1,X2) = X3
| def_10(X2,X1)
| plus(X3,X2) != X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_5) ).
cnf(axiom_7,axiom,
( ~ def_10(X1,X2)
| X2 != X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_7) ).
cnf(axiom_71,axiom,
( p_Reset(X1)
| p_Wr(X1)
| int_level(plus(X1,n1)) = minus(int_level(X1),n1)
| ~ p_Rd(X1)
| ~ gt(int_level(X1),n0) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_71) ).
cnf(axiom_24,axiom,
( p_Empty(X1)
| int_level(X1) != n0 ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_24) ).
cnf(axiom_21,axiom,
level(X1) = int_level(X1),
file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_21) ).
cnf(quest_2,negated_conjecture,
~ p_Wr(t_139),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_2) ).
cnf(quest_4,negated_conjecture,
~ p_Reset(t_139),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_4) ).
cnf(axiom_19,axiom,
plus(n0,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_19) ).
cnf(axiom_2,axiom,
gt(plus(X1,n1),n0),
file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_2) ).
cnf(quest_1,negated_conjecture,
level(t_139) = n1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_1) ).
cnf(quest_3,negated_conjecture,
p_Rd(t_139),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_3) ).
cnf(quest_5,negated_conjecture,
~ p_Empty(plus(t_139,n1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_5) ).
cnf(c_0_12,plain,
( minus(X1,X2) = X3
| def_10(X2,X1)
| plus(X3,X2) != X1 ),
inference(fof_simplification,[status(thm)],[axiom_5]) ).
cnf(c_0_13,plain,
( ~ def_10(X1,X2)
| X2 != X1 ),
inference(fof_simplification,[status(thm)],[axiom_7]) ).
cnf(c_0_14,plain,
( p_Reset(X1)
| p_Wr(X1)
| int_level(plus(X1,n1)) = minus(int_level(X1),n1)
| ~ p_Rd(X1)
| ~ gt(int_level(X1),n0) ),
inference(fof_simplification,[status(thm)],[axiom_71]) ).
cnf(c_0_15,plain,
( minus(X1,X2) = X3
| def_10(X2,X1)
| plus(X3,X2) != X1 ),
c_0_12 ).
cnf(c_0_16,plain,
( ~ def_10(X1,X2)
| X2 != X1 ),
c_0_13 ).
cnf(c_0_17,plain,
( p_Empty(X1)
| int_level(X1) != n0 ),
inference(fof_simplification,[status(thm)],[axiom_24]) ).
cnf(c_0_18,plain,
( p_Reset(X1)
| p_Wr(X1)
| int_level(plus(X1,n1)) = minus(int_level(X1),n1)
| ~ p_Rd(X1)
| ~ gt(int_level(X1),n0) ),
c_0_14 ).
cnf(c_0_19,axiom,
level(X1) = int_level(X1),
axiom_21 ).
cnf(c_0_20,negated_conjecture,
~ p_Wr(t_139),
inference(fof_simplification,[status(thm)],[quest_2]) ).
cnf(c_0_21,negated_conjecture,
~ p_Reset(t_139),
inference(fof_simplification,[status(thm)],[quest_4]) ).
cnf(c_0_22,plain,
( minus(plus(X1,X2),X2) = X1
| def_10(X2,plus(X1,X2)) ),
inference(er,[status(thm)],[c_0_15]) ).
cnf(c_0_23,axiom,
plus(n0,X1) = X1,
axiom_19 ).
cnf(c_0_24,plain,
~ def_10(X1,X1),
inference(er,[status(thm)],[c_0_16]) ).
cnf(c_0_25,axiom,
gt(plus(X1,n1),n0),
axiom_2 ).
cnf(c_0_26,plain,
( p_Empty(X1)
| int_level(X1) != n0 ),
c_0_17 ).
cnf(c_0_27,plain,
( level(plus(X1,n1)) = minus(level(X1),n1)
| p_Reset(X1)
| p_Wr(X1)
| ~ p_Rd(X1)
| ~ gt(level(X1),n0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19]),c_0_19]),c_0_19]) ).
cnf(c_0_28,negated_conjecture,
level(t_139) = n1,
quest_1 ).
cnf(c_0_29,negated_conjecture,
p_Rd(t_139),
quest_3 ).
cnf(c_0_30,negated_conjecture,
~ p_Wr(t_139),
c_0_20 ).
cnf(c_0_31,negated_conjecture,
~ p_Reset(t_139),
c_0_21 ).
cnf(c_0_32,plain,
minus(X1,X1) = n0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).
cnf(c_0_33,plain,
gt(n1,n0),
inference(spm,[status(thm)],[c_0_25,c_0_23]) ).
cnf(c_0_34,negated_conjecture,
~ p_Empty(plus(t_139,n1)),
inference(fof_simplification,[status(thm)],[quest_5]) ).
cnf(c_0_35,plain,
( p_Empty(X1)
| level(X1) != n0 ),
inference(rw,[status(thm)],[c_0_26,c_0_19]) ).
cnf(c_0_36,negated_conjecture,
level(plus(t_139,n1)) = n0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]),c_0_30]),c_0_31]),c_0_32]),c_0_33])]) ).
cnf(c_0_37,negated_conjecture,
~ p_Empty(plus(t_139,n1)),
c_0_34 ).
cnf(c_0_38,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : HWV023-1 : TPTP v8.2.0. Released v2.5.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n024.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun May 19 11:03:08 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order model finding
% 0.20/0.49 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.20/0.52 # Version: 3.1.0
% 0.20/0.52 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.52 # Starting sh5l with 300s (1) cores
% 0.20/0.52 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 3266 completed with status 0
% 0.20/0.52 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.20/0.52 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.52 # No SInE strategy applied
% 0.20/0.52 # Search class: FGHSS-FFMS21-SFFFFFNN
% 0.20/0.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.20/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.20/0.52 # Starting new_bool_3 with 136s (1) cores
% 0.20/0.52 # Starting new_bool_1 with 136s (1) cores
% 0.20/0.52 # Starting sh5l with 136s (1) cores
% 0.20/0.52 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 3274 completed with status 0
% 0.20/0.52 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.20/0.52 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.52 # No SInE strategy applied
% 0.20/0.52 # Search class: FGHSS-FFMS21-SFFFFFNN
% 0.20/0.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.20/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.20/0.52 # Preprocessing time : 0.002 s
% 0.20/0.52 # Presaturation interreduction done
% 0.20/0.52
% 0.20/0.52 # Proof found!
% 0.20/0.52 # SZS status Unsatisfiable
% 0.20/0.52 # SZS output start CNFRefutation
% See solution above
% 0.20/0.52 # Parsed axioms : 95
% 0.20/0.52 # Removed by relevancy pruning/SinE : 0
% 0.20/0.52 # Initial clauses : 95
% 0.20/0.52 # Removed in clause preprocessing : 1
% 0.20/0.52 # Initial clauses in saturation : 94
% 0.20/0.52 # Processed clauses : 214
% 0.20/0.52 # ...of these trivial : 3
% 0.20/0.52 # ...subsumed : 10
% 0.20/0.52 # ...remaining for further processing : 201
% 0.20/0.52 # Other redundant clauses eliminated : 6
% 0.20/0.52 # Clauses deleted for lack of memory : 0
% 0.20/0.52 # Backward-subsumed : 16
% 0.20/0.52 # Backward-rewritten : 2
% 0.20/0.52 # Generated clauses : 291
% 0.20/0.52 # ...of the previous two non-redundant : 231
% 0.20/0.52 # ...aggressively subsumed : 0
% 0.20/0.52 # Contextual simplify-reflections : 61
% 0.20/0.52 # Paramodulations : 282
% 0.20/0.52 # Factorizations : 2
% 0.20/0.52 # NegExts : 0
% 0.20/0.52 # Equation resolutions : 7
% 0.20/0.52 # Disequality decompositions : 0
% 0.20/0.52 # Total rewrite steps : 42
% 0.20/0.52 # ...of those cached : 32
% 0.20/0.52 # Propositional unsat checks : 0
% 0.20/0.52 # Propositional check models : 0
% 0.20/0.52 # Propositional check unsatisfiable : 0
% 0.20/0.52 # Propositional clauses : 0
% 0.20/0.52 # Propositional clauses after purity: 0
% 0.20/0.52 # Propositional unsat core size : 0
% 0.20/0.52 # Propositional preprocessing time : 0.000
% 0.20/0.52 # Propositional encoding time : 0.000
% 0.20/0.52 # Propositional solver time : 0.000
% 0.20/0.52 # Success case prop preproc time : 0.000
% 0.20/0.52 # Success case prop encoding time : 0.000
% 0.20/0.52 # Success case prop solver time : 0.000
% 0.20/0.52 # Current number of processed clauses : 104
% 0.20/0.52 # Positive orientable unit clauses : 12
% 0.20/0.52 # Positive unorientable unit clauses: 0
% 0.20/0.52 # Negative unit clauses : 7
% 0.20/0.52 # Non-unit-clauses : 85
% 0.20/0.52 # Current number of unprocessed clauses: 186
% 0.20/0.52 # ...number of literals in the above : 851
% 0.20/0.52 # Current number of archived formulas : 0
% 0.20/0.52 # Current number of archived clauses : 95
% 0.20/0.52 # Clause-clause subsumption calls (NU) : 3162
% 0.20/0.52 # Rec. Clause-clause subsumption calls : 665
% 0.20/0.52 # Non-unit clause-clause subsumptions : 83
% 0.20/0.52 # Unit Clause-clause subsumption calls : 169
% 0.20/0.52 # Rewrite failures with RHS unbound : 0
% 0.20/0.52 # BW rewrite match attempts : 7
% 0.20/0.52 # BW rewrite match successes : 2
% 0.20/0.52 # Condensation attempts : 0
% 0.20/0.52 # Condensation successes : 0
% 0.20/0.52 # Termbank termtop insertions : 10217
% 0.20/0.52 # Search garbage collected termcells : 192
% 0.20/0.52
% 0.20/0.52 # -------------------------------------------------
% 0.20/0.52 # User time : 0.025 s
% 0.20/0.52 # System time : 0.000 s
% 0.20/0.52 # Total time : 0.025 s
% 0.20/0.52 # Maximum resident set size: 1828 pages
% 0.20/0.52
% 0.20/0.52 # -------------------------------------------------
% 0.20/0.52 # User time : 0.100 s
% 0.20/0.52 # System time : 0.005 s
% 0.20/0.52 # Total time : 0.104 s
% 0.20/0.52 # Maximum resident set size: 1768 pages
% 0.20/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------