TSTP Solution File: HWV052-1.001.001 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : HWV052-1.001.001 : TPTP v8.2.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.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:37:20 EDT 2024
% Result : Unsatisfiable 0.19s 0.48s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of clauses : 23 ( 16 unt; 7 nHn; 13 RR)
% Number of literals : 30 ( 29 equ; 4 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 13 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(bit_inverse,axiom,
inv(X1) != X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',bit_inverse) ).
cnf(bit_domain,axiom,
( X1 = o
| X1 = i ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',bit_domain) ).
cnf(unpack1_01,axiom,
unpack1(inv(X1),pack1(X1)) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',unpack1_01) ).
cnf(unpack1,axiom,
unpack1(X1,pack1(X1)) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',unpack1) ).
cnf(unpack1_02,axiom,
unpack1(X1,inv(pack1(X1))) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',unpack1_02) ).
cnf(c_0_5,plain,
inv(X1) != X1,
inference(fof_simplification,[status(thm)],[bit_inverse]) ).
cnf(c_0_6,plain,
inv(X1) != X1,
c_0_5 ).
cnf(c_0_7,axiom,
( X1 = o
| X1 = i ),
bit_domain ).
cnf(c_0_8,axiom,
unpack1(inv(X1),pack1(X1)) = X1,
unpack1_01 ).
cnf(c_0_9,plain,
inv(i) = o,
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7])]) ).
cnf(c_0_10,plain,
unpack1(o,pack1(i)) = i,
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_11,axiom,
unpack1(X1,pack1(X1)) = X1,
unpack1 ).
cnf(c_0_12,plain,
( unpack1(o,i) = i
| pack1(i) = o ),
inference(spm,[status(thm)],[c_0_10,c_0_7]) ).
cnf(c_0_13,plain,
( unpack1(X1,i) = X1
| pack1(X1) = o ),
inference(spm,[status(thm)],[c_0_11,c_0_7]) ).
cnf(c_0_14,plain,
i != o,
inference(spm,[status(thm)],[c_0_6,c_0_9]) ).
cnf(c_0_15,axiom,
unpack1(X1,inv(pack1(X1))) = X1,
unpack1_02 ).
cnf(c_0_16,plain,
( pack1(o) = o
| pack1(i) = o ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
cnf(c_0_17,plain,
( unpack1(X1,o) = X1
| pack1(X1) = o ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_7]),c_0_9]) ).
cnf(c_0_18,plain,
( unpack1(o,o) = i
| pack1(o) = o ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_16]),c_0_9]) ).
cnf(c_0_19,plain,
pack1(o) = o,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_14]) ).
cnf(c_0_20,plain,
unpack1(inv(o),o) = o,
inference(spm,[status(thm)],[c_0_8,c_0_19]) ).
cnf(c_0_21,plain,
pack1(inv(o)) = o,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_20]),c_0_6]) ).
cnf(c_0_22,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_21]),c_0_20]),c_0_6]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : HWV052-1.001.001 : TPTP v8.2.0. Released v4.1.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n028.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 11:43:38 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order model finding
% 0.19/0.47 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.19/0.48 # Version: 3.1.0
% 0.19/0.48 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.48 # Starting sh5l with 300s (1) cores
% 0.19/0.48 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 30224 completed with status 0
% 0.19/0.48 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.19/0.48 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.48 # No SInE strategy applied
% 0.19/0.48 # Search class: FGUPS-FFSF21-MFFFFFNN
% 0.19/0.48 # partial match(1): FUUPS-FFSF21-MFFFFFNN
% 0.19/0.48 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.48 # Starting U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.19/0.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.19/0.48 # Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.19/0.48 # Starting U----_206d_05_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.19/0.48 # Starting U----_206d_02_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.19/0.48 # U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 30231 completed with status 0
% 0.19/0.48 # Result found by U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.48 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.48 # No SInE strategy applied
% 0.19/0.48 # Search class: FGUPS-FFSF21-MFFFFFNN
% 0.19/0.48 # partial match(1): FUUPS-FFSF21-MFFFFFNN
% 0.19/0.48 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.48 # Starting U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.19/0.48 # Preprocessing time : 0.001 s
% 0.19/0.48 # Presaturation interreduction done
% 0.19/0.48
% 0.19/0.48 # Proof found!
% 0.19/0.48 # SZS status Unsatisfiable
% 0.19/0.48 # SZS output start CNFRefutation
% See solution above
% 0.19/0.48 # Parsed axioms : 5
% 0.19/0.48 # Removed by relevancy pruning/SinE : 0
% 0.19/0.48 # Initial clauses : 5
% 0.19/0.48 # Removed in clause preprocessing : 0
% 0.19/0.48 # Initial clauses in saturation : 5
% 0.19/0.48 # Processed clauses : 33
% 0.19/0.48 # ...of these trivial : 0
% 0.19/0.48 # ...subsumed : 8
% 0.19/0.48 # ...remaining for further processing : 25
% 0.19/0.48 # Other redundant clauses eliminated : 5
% 0.19/0.48 # Clauses deleted for lack of memory : 0
% 0.19/0.48 # Backward-subsumed : 0
% 0.19/0.48 # Backward-rewritten : 2
% 0.19/0.48 # Generated clauses : 220
% 0.19/0.48 # ...of the previous two non-redundant : 149
% 0.19/0.48 # ...aggressively subsumed : 0
% 0.19/0.48 # Contextual simplify-reflections : 0
% 0.19/0.48 # Paramodulations : 189
% 0.19/0.48 # Factorizations : 26
% 0.19/0.48 # NegExts : 0
% 0.19/0.48 # Equation resolutions : 5
% 0.19/0.48 # Disequality decompositions : 0
% 0.19/0.48 # Total rewrite steps : 54
% 0.19/0.48 # ...of those cached : 46
% 0.19/0.48 # Propositional unsat checks : 0
% 0.19/0.48 # Propositional check models : 0
% 0.19/0.48 # Propositional check unsatisfiable : 0
% 0.19/0.48 # Propositional clauses : 0
% 0.19/0.48 # Propositional clauses after purity: 0
% 0.19/0.48 # Propositional unsat core size : 0
% 0.19/0.48 # Propositional preprocessing time : 0.000
% 0.19/0.48 # Propositional encoding time : 0.000
% 0.19/0.48 # Propositional solver time : 0.000
% 0.19/0.48 # Success case prop preproc time : 0.000
% 0.19/0.48 # Success case prop encoding time : 0.000
% 0.19/0.48 # Success case prop solver time : 0.000
% 0.19/0.48 # Current number of processed clauses : 18
% 0.19/0.48 # Positive orientable unit clauses : 9
% 0.19/0.48 # Positive unorientable unit clauses: 0
% 0.19/0.48 # Negative unit clauses : 2
% 0.19/0.48 # Non-unit-clauses : 7
% 0.19/0.48 # Current number of unprocessed clauses: 125
% 0.19/0.48 # ...number of literals in the above : 372
% 0.19/0.48 # Current number of archived formulas : 0
% 0.19/0.48 # Current number of archived clauses : 7
% 0.19/0.48 # Clause-clause subsumption calls (NU) : 22
% 0.19/0.48 # Rec. Clause-clause subsumption calls : 22
% 0.19/0.48 # Non-unit clause-clause subsumptions : 7
% 0.19/0.48 # Unit Clause-clause subsumption calls : 4
% 0.19/0.48 # Rewrite failures with RHS unbound : 0
% 0.19/0.48 # BW rewrite match attempts : 1
% 0.19/0.48 # BW rewrite match successes : 1
% 0.19/0.48 # Condensation attempts : 0
% 0.19/0.48 # Condensation successes : 0
% 0.19/0.48 # Termbank termtop insertions : 808
% 0.19/0.48 # Search garbage collected termcells : 2
% 0.19/0.48
% 0.19/0.48 # -------------------------------------------------
% 0.19/0.48 # User time : 0.005 s
% 0.19/0.48 # System time : 0.001 s
% 0.19/0.48 # Total time : 0.006 s
% 0.19/0.48 # Maximum resident set size: 1604 pages
% 0.19/0.48
% 0.19/0.48 # -------------------------------------------------
% 0.19/0.48 # User time : 0.017 s
% 0.19/0.48 # System time : 0.008 s
% 0.19/0.48 # Total time : 0.025 s
% 0.19/0.48 # Maximum resident set size: 1684 pages
% 0.19/0.48 % E---3.1 exiting
%------------------------------------------------------------------------------