%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : GRP011-4 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n006.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:41:21 PM UTC 2026
% Result : Unsatisfiable 0.15s 10.65s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of clauses : 19 ( 19 unt; 0 nHn; 6 RR)
% Number of literals : 19 ( 18 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 19 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',associativity) ).
cnf(left_inverse,axiom,
multiply(inverse(X1),X1) = identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_inverse) ).
cnf(left_identity,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_identity) ).
cnf(product_equality,hypothesis,
multiply(b,c) = multiply(d,c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',product_equality) ).
cnf(prove_left_cancellation,negated_conjecture,
b != d,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_left_cancellation) ).
cnf(c_0_5,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity ).
cnf(c_0_6,axiom,
multiply(inverse(X1),X1) = identity,
left_inverse ).
cnf(c_0_7,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_8,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7]) ).
cnf(c_0_9,plain,
multiply(inverse(inverse(X1)),identity) = X1,
inference(spm,[status(thm)],[c_0_8,c_0_6]) ).
cnf(c_0_10,plain,
multiply(inverse(inverse(X1)),X2) = multiply(X1,X2),
inference(spm,[status(thm)],[c_0_8,c_0_8]) ).
cnf(c_0_11,plain,
multiply(X1,identity) = X1,
inference(rw,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,hypothesis,
multiply(b,c) = multiply(d,c),
product_equality ).
cnf(c_0_13,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_11]) ).
cnf(c_0_14,negated_conjecture,
b != d,
inference(fof_simplification,[status(thm)],[prove_left_cancellation]) ).
cnf(c_0_15,hypothesis,
multiply(b,multiply(c,X1)) = multiply(d,multiply(c,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_12]),c_0_5]) ).
cnf(c_0_16,plain,
multiply(X1,inverse(X1)) = identity,
inference(spm,[status(thm)],[c_0_6,c_0_13]) ).
cnf(c_0_17,negated_conjecture,
b != d,
c_0_14 ).
cnf(c_0_18,hypothesis,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_11]),c_0_11]),c_0_17]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP011-4 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/10.59 % Computer : n006.cluster.edu
% 0.11/10.59 % Model : x86_64 x86_64
% 0.11/10.59 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/10.59 % Memory : 8046.5625MB
% 0.11/10.59 % OS : Linux 6.8.0-71-generic
% 0.11/10.59 % CPULimit : 300
% 0.11/10.59 % WCLimit : 300
% 0.11/10.59 % DateTime : Sun Sep 20 19:53:42 UTC 2026
% 0.11/10.59 % CPUTime :
% 0.11/10.59 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/10.63 Running first-order theorem proving
% 0.15/10.63 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/benchmark/theBenchmark.p
% 0.15/10.65 % Version: 3.5.1
% 0.15/10.65 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/10.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/10.65 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/10.65 % Starting new_bool_3 with 300s (1) cores
% 0.15/10.65 % Starting new_bool_1 with 300s (1) cores
% 0.15/10.65 % Starting sh5l with 300s (1) cores
% 0.15/10.65 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1124538 completed with status 0
% 0.15/10.65 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.15/10.65 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/10.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/10.65 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/10.65 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/10.65 % No SInE strategy applied
% 0.15/10.65 % Search class: FUUPS-FFSF21-SFFFFFNN
% 0.15/10.65 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/10.65 % Starting SubtermCWHack with 136s (1) cores
% 0.15/10.65 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.15/10.65 % Starting C12_02_nc_SAT001_MinMin_p005000_rr with 136s (1) cores
% 0.15/10.65 % Starting new_bool_3 with 136s (1) cores
% 0.15/10.65 % Starting new_bool_1 with 136s (1) cores
% 0.15/10.65 % C12_02_nc_SAT001_MinMin_p005000_rr with pid 1124545 completed with status 0
% 0.15/10.65 % Result found by C12_02_nc_SAT001_MinMin_p005000_rr
% 0.15/10.65 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/10.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/10.65 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/10.65 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/10.65 % No SInE strategy applied
% 0.15/10.65 % Search class: FUUPS-FFSF21-SFFFFFNN
% 0.15/10.65 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/10.65 % Starting SubtermCWHack with 136s (1) cores
% 0.15/10.65 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.15/10.65 % Starting C12_02_nc_SAT001_MinMin_p005000_rr with 136s (1) cores
% 0.15/10.65 % Preprocessing time : 0.001 s
% 0.15/10.65 % Presaturation interreduction done
% 0.15/10.65
% 0.15/10.65 % Proof found!
% 0.15/10.65 % SZS status Unsatisfiable
% 0.15/10.65 % SZS output start CNFRefutation
% See solution above
% 0.15/10.65 % Parsed axioms : 5
% 0.15/10.65 % Removed by relevancy pruning/SinE : 0
% 0.15/10.65 % Initial clauses : 5
% 0.15/10.65 % Removed in clause preprocessing : 0
% 0.15/10.65 % Initial clauses in saturation : 5
% 0.15/10.65 % Processed clauses : 22
% 0.15/10.65 % ...of these trivial : 0
% 0.15/10.65 % ...subsumed : 0
% 0.15/10.65 % ...remaining for further processing : 22
% 0.15/10.65 % Other redundant clauses eliminated : 0
% 0.15/10.65 % Clauses deleted for lack of memory : 0
% 0.15/10.65 % Backward-subsumed : 0
% 0.15/10.65 % Backward-rewritten : 5
% 0.15/10.65 % Generated clauses : 50
% 0.15/10.65 % ...of the previous two non-redundant : 23
% 0.15/10.65 % ...aggressively subsumed : 0
% 0.15/10.65 % Contextual simplify-reflections : 0
% 0.15/10.65 % Paramodulations : 50
% 0.15/10.65 % Factorizations : 0
% 0.15/10.65 % NegExts : 0
% 0.15/10.65 % Equation resolutions : 0
% 0.15/10.65 % Disequality decompositions : 0
% 0.15/10.65 % Total rewrite steps : 50
% 0.15/10.65 % ...of those cached : 20
% 0.15/10.65 % Propositional unsat checks : 0
% 0.15/10.65 % Propositional check models : 0
% 0.15/10.65 % Propositional check unsatisfiable : 0
% 0.15/10.65 % Propositional clauses : 0
% 0.15/10.65 % Propositional clauses after purity: 0
% 0.15/10.65 % Propositional unsat core size : 0
% 0.15/10.65 % Propositional preprocessing time : 0.000
% 0.15/10.65 % Propositional encoding time : 0.000
% 0.15/10.65 % Propositional solver time : 0.000
% 0.15/10.65 % Success case prop preproc time : 0.000
% 0.15/10.65 % Success case prop encoding time : 0.000
% 0.15/10.65 % Success case prop solver time : 0.000
% 0.15/10.65 % Current number of processed clauses : 12
% 0.15/10.65 % Positive orientable unit clauses : 11
% 0.15/10.65 % Positive unorientable unit clauses: 0
% 0.15/10.65 % Negative unit clauses : 1
% 0.15/10.65 % Non-unit-clauses : 0
% 0.15/10.65 % Current number of unprocessed clauses: 10
% 0.15/10.65 % ...number of literals in the above : 10
% 0.15/10.65 % Current number of archived formulas : 0
% 0.15/10.65 % Current number of archived clauses : 10
% 0.15/10.65 % Clause-clause subsumption calls (NU) : 0
% 0.15/10.65 % Rec. Clause-clause subsumption calls : 0
% 0.15/10.65 % Non-unit clause-clause subsumptions : 0
% 0.15/10.65 % Unit Clause-clause subsumption calls : 0
% 0.15/10.65 % Rewrite failures with RHS unbound : 0
% 0.15/10.65 % BW rewrite match attempts : 7
% 0.15/10.65 % BW rewrite match successes : 5
% 0.15/10.65 % Condensation attempts : 0
% 0.15/10.65 % Condensation successes : 0
% 0.15/10.65 % Termbank termtop insertions : 456
% 0.15/10.65 % Search garbage collected termcells : 2
% 0.15/10.65
% 0.15/10.65 % -------------------------------------------------
% 0.15/10.65 % User time : 0.003 s
% 0.15/10.65 % System time : 0.002 s
% 0.15/10.65 % Total time : 0.005 s
% 0.15/10.65 % Maximum resident set size: 3628 pages
% 0.15/10.65
% 0.15/10.65 % -------------------------------------------------
% 0.15/10.65 % User time : 0.013 s
% 0.15/10.65 % System time : 0.007 s
% 0.15/10.65 % Total time : 0.020 s
% 0.15/10.65 % Maximum resident set size: 4608 pages
% 0.15/10.65 % E exiting
%------------------------------------------------------------------------------