%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : HWV052-1.002.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 : n012.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.08s 0.35s
% Output : CNFRefutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 5
% Syntax : Number of clauses : 28 ( 17 unt; 11 nHn; 7 RR)
% Number of literals : 41 ( 40 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-3 aty)
% Number of variables : 39 ( 3 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(unpack2_05,axiom,
unpack2(X1,inv(X2),pack1(X1,X2)) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unpack2_05) ).
cnf(unpack2,axiom,
unpack2(X1,X2,pack1(X1,X2)) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unpack2) ).
cnf(unpack2_06,axiom,
unpack2(X1,X2,inv(pack1(X1,X2))) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unpack2_06) ).
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,
unpack2(X1,inv(X2),pack1(X1,X2)) = X2,
unpack2_05 ).
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,
( X2 = X1
| X2 = o
| X1 = o ),
inference(spm,[status(thm)],[c_0_7,c_0_7]) ).
cnf(c_0_11,plain,
unpack2(X1,o,pack1(X1,i)) = i,
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,plain,
( X1 = o
| inv(o) = X1 ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_10])]) ).
cnf(c_0_13,plain,
i != o,
inference(spm,[status(thm)],[c_0_6,c_0_9]) ).
cnf(c_0_14,plain,
inv(o) = i,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_11]),c_0_13]) ).
cnf(c_0_15,plain,
( X2 = X1
| X2 = o
| inv(X1) = i ),
inference(spm,[status(thm)],[c_0_14,c_0_10]) ).
cnf(c_0_16,axiom,
unpack2(X1,X2,pack1(X1,X2)) = X2,
unpack2 ).
cnf(c_0_17,axiom,
unpack2(X1,X2,inv(pack1(X1,X2))) = X2,
unpack2_06 ).
cnf(c_0_18,plain,
( X1 = i
| inv(X1) = i ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_15]),c_0_11]),c_0_13]) ).
cnf(c_0_19,plain,
( pack1(X1,X2) = o
| unpack2(X1,X2,i) = X2 ),
inference(spm,[status(thm)],[c_0_16,c_0_7]) ).
cnf(c_0_20,plain,
( pack1(X1,X2) = o
| unpack2(X1,inv(X2),i) = X2 ),
inference(spm,[status(thm)],[c_0_8,c_0_7]) ).
cnf(c_0_21,plain,
( pack1(X1,X2) = i
| unpack2(X1,X2,i) = X2 ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,plain,
( pack1(X1,X2) = o
| pack1(X1,inv(X2)) = o ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_6]) ).
cnf(c_0_23,plain,
( pack1(X1,X2) = o
| pack1(X1,inv(X2)) = i ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_20]),c_0_6]) ).
cnf(c_0_24,plain,
pack1(X1,X2) = o,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_13]) ).
cnf(c_0_25,plain,
unpack2(X1,i,pack1(X1,o)) = o,
inference(spm,[status(thm)],[c_0_8,c_0_14]) ).
cnf(c_0_26,plain,
unpack2(X1,X2,o) = X2,
inference(rw,[status(thm)],[c_0_16,c_0_24]) ).
cnf(c_0_27,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_24]),c_0_26]),c_0_13]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : HWV052-1.002.001 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.03 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.06/0.30 % Computer : n012.cluster.edu
% 0.06/0.30 % Model : x86_64 x86_64
% 0.06/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.30 % Memory : 8046.5625MB
% 0.06/0.30 % OS : Linux 6.8.0-71-generic
% 0.06/0.30 % CPULimit : 300
% 0.06/0.30 % WCLimit : 300
% 0.06/0.30 % DateTime : Sun Sep 20 21:03:21 UTC 2026
% 0.06/0.30 % CPUTime :
% 0.06/0.30 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.06/0.33 Running first-order theorem proving
% 0.06/0.33 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.08/0.35 % Version: 3.5.1
% 0.08/0.35 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.08/0.35 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.35 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.08/0.35 % Starting new_bool_3 with 300s (1) cores
% 0.08/0.35 % Starting new_bool_1 with 300s (1) cores
% 0.08/0.35 % Starting sh5l with 300s (1) cores
% 0.08/0.35 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 854517 completed with status 0
% 0.08/0.35 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.08/0.35 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.08/0.35 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.35 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.08/0.35 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.08/0.35 % No SInE strategy applied
% 0.08/0.35 % Search class: FGUPM-FFSF32-MFFFFFNN
% 0.08/0.35 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.08/0.35 % Starting SubtermCWHack with 136s (1) cores
% 0.08/0.35 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.08/0.35 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.08/0.35 % Starting new_bool_3 with 136s (1) cores
% 0.08/0.35 % Starting new_bool_1 with 136s (1) cores
% 0.08/0.35 % new_bool_1 with pid 854527 completed with status 0
% 0.08/0.35 % Result found by new_bool_1
% 0.08/0.35 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.08/0.35 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.35 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.08/0.35 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.08/0.35 % No SInE strategy applied
% 0.08/0.35 % Search class: FGUPM-FFSF32-MFFFFFNN
% 0.08/0.35 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.08/0.35 % Starting SubtermCWHack with 136s (1) cores
% 0.08/0.35 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.08/0.35 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.08/0.35 % Starting new_bool_3 with 136s (1) cores
% 0.08/0.35 % Starting new_bool_1 with 136s (1) cores
% 0.08/0.35 % Preprocessing time : 0.001 s
% 0.08/0.35 % Presaturation interreduction done
% 0.08/0.35
% 0.08/0.35 % Proof found!
% 0.08/0.35 % SZS status Unsatisfiable
% 0.08/0.35 % SZS output start CNFRefutation
% See solution above
% 0.08/0.35 % Parsed axioms : 10
% 0.08/0.35 % Removed by relevancy pruning/SinE : 0
% 0.08/0.35 % Initial clauses : 10
% 0.08/0.35 % Removed in clause preprocessing : 0
% 0.08/0.35 % Initial clauses in saturation : 10
% 0.08/0.35 % Processed clauses : 168
% 0.08/0.35 % ...of these trivial : 0
% 0.08/0.35 % ...subsumed : 108
% 0.08/0.35 % ...remaining for further processing : 59
% 0.08/0.35 % Other redundant clauses eliminated : 18
% 0.08/0.35 % Clauses deleted for lack of memory : 0
% 0.08/0.35 % Backward-subsumed : 1
% 0.08/0.35 % Backward-rewritten : 30
% 0.08/0.35 % Generated clauses : 803
% 0.08/0.35 % ...of the previous two non-redundant : 696
% 0.08/0.35 % ...aggressively subsumed : 0
% 0.08/0.35 % Contextual simplify-reflections : 0
% 0.08/0.35 % Paramodulations : 749
% 0.08/0.35 % Factorizations : 36
% 0.08/0.35 % NegExts : 0
% 0.08/0.35 % Equation resolutions : 18
% 0.08/0.35 % Disequality decompositions : 0
% 0.08/0.35 % Total rewrite steps : 238
% 0.08/0.35 % ...of those cached : 205
% 0.08/0.35 % Propositional unsat checks : 0
% 0.08/0.35 % Propositional check models : 0
% 0.08/0.35 % Propositional check unsatisfiable : 0
% 0.08/0.35 % Propositional clauses : 0
% 0.08/0.35 % Propositional clauses after purity: 0
% 0.08/0.35 % Propositional unsat core size : 0
% 0.08/0.35 % Propositional preprocessing time : 0.000
% 0.08/0.35 % Propositional encoding time : 0.000
% 0.08/0.35 % Propositional solver time : 0.000
% 0.08/0.35 % Success case prop preproc time : 0.000
% 0.08/0.35 % Success case prop encoding time : 0.000
% 0.08/0.35 % Success case prop solver time : 0.000
% 0.08/0.35 % Current number of processed clauses : 18
% 0.08/0.35 % Positive orientable unit clauses : 9
% 0.08/0.35 % Positive unorientable unit clauses: 0
% 0.08/0.35 % Negative unit clauses : 2
% 0.08/0.35 % Non-unit-clauses : 7
% 0.08/0.35 % Current number of unprocessed clauses: 535
% 0.08/0.35 % ...number of literals in the above : 1557
% 0.08/0.35 % Current number of archived formulas : 0
% 0.08/0.35 % Current number of archived clauses : 41
% 0.08/0.35 % Clause-clause subsumption calls (NU) : 168
% 0.08/0.35 % Rec. Clause-clause subsumption calls : 168
% 0.08/0.35 % Non-unit clause-clause subsumptions : 102
% 0.08/0.35 % Unit Clause-clause subsumption calls : 2
% 0.08/0.35 % Rewrite failures with RHS unbound : 0
% 0.08/0.35 % BW rewrite match attempts : 27
% 0.08/0.35 % BW rewrite match successes : 7
% 0.08/0.35 % Condensation attempts : 0
% 0.08/0.35 % Condensation successes : 0
% 0.08/0.35 % Termbank termtop insertions : 3600
% 0.08/0.35 % Search garbage collected termcells : 2
% 0.08/0.35
% 0.08/0.35 % -------------------------------------------------
% 0.08/0.35 % User time : 0.007 s
% 0.08/0.35 % System time : 0.001 s
% 0.08/0.35 % Total time : 0.008 s
% 0.08/0.35 % Maximum resident set size: 3580 pages
% 0.08/0.35
% 0.08/0.35 % -------------------------------------------------
% 0.08/0.35 % User time : 0.020 s
% 0.08/0.35 % System time : 0.009 s
% 0.08/0.35 % Total time : 0.029 s
% 0.08/0.35 % Maximum resident set size: 4864 pages
% 0.08/0.35 % E exiting
%------------------------------------------------------------------------------