%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : HWV052-1.001.001 : TPTP v9.3.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n018.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 12:48:02 PM UTC 2026
% Result : Unsatisfiable 0.10s 0.43s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of clauses : 27 ( 18 unt; 9 nHn; 15 RR)
% Number of literals : 37 ( 36 equ; 4 neg)
% Maximal clause size : 3 ( 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 : 16 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(bit_inverse,axiom,
inv(X1) != X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',bit_inverse) ).
cnf(bit_domain,axiom,
( X1 = i
| X1 = o ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',bit_domain) ).
cnf(unpack1_01,axiom,
unpack1(inv(X1),pack1(X1)) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unpack1_01) ).
cnf(unpack1,axiom,
unpack1(X1,pack1(X1)) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unpack1) ).
cnf(unpack1_02,axiom,
unpack1(X1,inv(pack1(X1))) = X1,
file('/export/starexec/sandbox2/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 = i
| X1 = o ),
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,axiom,
unpack1(X1,pack1(X1)) = X1,
unpack1 ).
cnf(c_0_11,plain,
unpack1(o,pack1(i)) = i,
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,plain,
( X2 = X1
| X2 = o
| X1 = o ),
inference(spm,[status(thm)],[c_0_7,c_0_7]) ).
cnf(c_0_13,plain,
( pack1(X1) = o
| unpack1(X1,i) = X1 ),
inference(spm,[status(thm)],[c_0_10,c_0_7]) ).
cnf(c_0_14,plain,
( pack1(i) = o
| unpack1(o,i) = i ),
inference(spm,[status(thm)],[c_0_11,c_0_7]) ).
cnf(c_0_15,plain,
i != o,
inference(spm,[status(thm)],[c_0_6,c_0_9]) ).
cnf(c_0_16,plain,
( X1 = o
| inv(o) = X1 ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_12])]) ).
cnf(c_0_17,axiom,
unpack1(X1,inv(pack1(X1))) = X1,
unpack1_02 ).
cnf(c_0_18,plain,
( pack1(o) = o
| pack1(i) = o ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).
cnf(c_0_19,plain,
inv(o) = i,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_16]),c_0_11]),c_0_15]) ).
cnf(c_0_20,plain,
( pack1(X1) = o
| unpack1(X1,o) = X1 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_7]),c_0_9]) ).
cnf(c_0_21,plain,
( pack1(o) = o
| unpack1(o,o) = i ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_18]),c_0_9]) ).
cnf(c_0_22,plain,
unpack1(i,pack1(o)) = o,
inference(spm,[status(thm)],[c_0_8,c_0_19]) ).
cnf(c_0_23,plain,
pack1(o) = o,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_15]) ).
cnf(c_0_24,plain,
unpack1(i,o) = o,
inference(rw,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_25,plain,
pack1(i) = o,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_24]),c_0_15]) ).
cnf(c_0_26,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_25]),c_0_24]),c_0_15]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : HWV052-1.001.001 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n018.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sun Sep 20 21:06:00 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.10/0.43 % Version: 3.5.1
% 0.10/0.43 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.10/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.43 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.10/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.43 % Starting sh5l with 300s (1) cores
% 0.10/0.43 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 189594 completed with status 0
% 0.10/0.43 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.10/0.43 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.10/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.43 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.10/0.43 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.43 % No SInE strategy applied
% 0.10/0.43 % Search class: FGUPS-FFSF21-MFFFFFNN
% 0.10/0.43 % partial match(1): FUUPS-FFSF21-MFFFFFNN
% 0.10/0.43 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.43 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.43 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.10/0.43 % Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 0.10/0.43 % Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.10/0.43 % Starting U----_206d_05_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.10/0.43 % SubtermCWHack with pid 189599 completed with status 0
% 0.10/0.43 % Result found by SubtermCWHack
% 0.10/0.43 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.10/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.43 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.10/0.43 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.43 % No SInE strategy applied
% 0.10/0.43 % Search class: FGUPS-FFSF21-MFFFFFNN
% 0.10/0.43 % partial match(1): FUUPS-FFSF21-MFFFFFNN
% 0.10/0.43 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.43 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.43 % Preprocessing time : 0.001 s
% 0.10/0.43
% 0.10/0.43 % Proof found!
% 0.10/0.43 % SZS status Unsatisfiable
% 0.10/0.43 % SZS output start CNFRefutation
% See solution above
% 0.10/0.43 % Parsed axioms : 5
% 0.10/0.43 % Removed by relevancy pruning/SinE : 0
% 0.10/0.43 % Initial clauses : 5
% 0.10/0.43 % Removed in clause preprocessing : 0
% 0.10/0.43 % Initial clauses in saturation : 5
% 0.10/0.43 % Processed clauses : 80
% 0.10/0.43 % ...of these trivial : 0
% 0.10/0.43 % ...subsumed : 49
% 0.10/0.43 % ...remaining for further processing : 31
% 0.10/0.43 % Other redundant clauses eliminated : 6
% 0.10/0.43 % Clauses deleted for lack of memory : 0
% 0.10/0.43 % Backward-subsumed : 0
% 0.10/0.43 % Backward-rewritten : 10
% 0.10/0.43 % Generated clauses : 347
% 0.10/0.43 % ...of the previous two non-redundant : 280
% 0.10/0.43 % ...aggressively subsumed : 0
% 0.10/0.43 % Contextual simplify-reflections : 0
% 0.10/0.43 % Paramodulations : 313
% 0.10/0.43 % Factorizations : 28
% 0.10/0.43 % NegExts : 0
% 0.10/0.43 % Equation resolutions : 6
% 0.10/0.43 % Disequality decompositions : 0
% 0.10/0.43 % Total rewrite steps : 61
% 0.10/0.43 % ...of those cached : 50
% 0.10/0.43 % Propositional unsat checks : 0
% 0.10/0.43 % Propositional check models : 0
% 0.10/0.43 % Propositional check unsatisfiable : 0
% 0.10/0.43 % Propositional clauses : 0
% 0.10/0.43 % Propositional clauses after purity: 0
% 0.10/0.43 % Propositional unsat core size : 0
% 0.10/0.43 % Propositional preprocessing time : 0.000
% 0.10/0.43 % Propositional encoding time : 0.000
% 0.10/0.43 % Propositional solver time : 0.000
% 0.10/0.43 % Success case prop preproc time : 0.000
% 0.10/0.43 % Success case prop encoding time : 0.000
% 0.10/0.43 % Success case prop solver time : 0.000
% 0.10/0.43 % Current number of processed clauses : 21
% 0.10/0.43 % Positive orientable unit clauses : 8
% 0.10/0.43 % Positive unorientable unit clauses: 0
% 0.10/0.43 % Negative unit clauses : 2
% 0.10/0.43 % Non-unit-clauses : 11
% 0.10/0.43 % Current number of unprocessed clauses: 195
% 0.10/0.43 % ...number of literals in the above : 611
% 0.10/0.43 % Current number of archived formulas : 0
% 0.10/0.43 % Current number of archived clauses : 10
% 0.10/0.43 % Clause-clause subsumption calls (NU) : 136
% 0.10/0.43 % Rec. Clause-clause subsumption calls : 127
% 0.10/0.43 % Non-unit clause-clause subsumptions : 47
% 0.10/0.43 % Unit Clause-clause subsumption calls : 13
% 0.10/0.43 % Rewrite failures with RHS unbound : 0
% 0.10/0.43 % BW rewrite match attempts : 3
% 0.10/0.43 % BW rewrite match successes : 3
% 0.10/0.43 % Condensation attempts : 0
% 0.10/0.43 % Condensation successes : 0
% 0.10/0.43 % Termbank termtop insertions : 1565
% 0.10/0.43 % Search garbage collected termcells : 2
% 0.10/0.43
% 0.10/0.43 % -------------------------------------------------
% 0.10/0.43 % User time : 0.004 s
% 0.10/0.43 % System time : 0.002 s
% 0.10/0.43 % Total time : 0.006 s
% 0.10/0.43 % Maximum resident set size: 3628 pages
% 0.10/0.43
% 0.10/0.43 % -------------------------------------------------
% 0.10/0.43 % User time : 0.015 s
% 0.10/0.43 % System time : 0.011 s
% 0.10/0.43 % Total time : 0.025 s
% 0.10/0.43 % Maximum resident set size: 4864 pages
% 0.10/0.43 % E exiting
%------------------------------------------------------------------------------