%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : COM010-1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n020.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:11:26 PM UTC 2026
% Result : Unsatisfiable 0.54s 0.63s
% Output : CNFRefutation 0.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 5
% Syntax : Number of clauses : 12 ( 12 unt; 0 nHn; 10 RR)
% Number of literals : 12 ( 11 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 3 con; 0-4 aty)
% Number of variables : 4 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_conjecture_3,negated_conjecture,
v_F != v_G,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_3) ).
cnf(cls_UNITY_Osurjective__mk__program_0,axiom,
c_UNITY_Omk__program(c_Pair(c_UNITY_OInit(X1,X2),c_Pair(c_UNITY_OActs(X1,X2),c_UNITY_OAllowedActs(X1,X2),tc_set(tc_set(tc_prod(X2,X2))),tc_set(tc_set(tc_prod(X2,X2)))),tc_set(X2),tc_prod(tc_set(tc_set(tc_prod(X2,X2))),tc_set(tc_set(tc_prod(X2,X2))))),X2) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_UNITY_Osurjective__mk__program_0) ).
cnf(cls_conjecture_2,negated_conjecture,
c_UNITY_OAllowedActs(v_F,t_a) = c_UNITY_OAllowedActs(v_G,t_a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_2) ).
cnf(cls_conjecture_0,negated_conjecture,
c_UNITY_OInit(v_F,t_a) = c_UNITY_OInit(v_G,t_a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(cls_conjecture_1,negated_conjecture,
c_UNITY_OActs(v_F,t_a) = c_UNITY_OActs(v_G,t_a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).
cnf(c_0_5,negated_conjecture,
v_F != v_G,
inference(fof_simplification,[status(thm)],[cls_conjecture_3]) ).
cnf(c_0_6,axiom,
c_UNITY_Omk__program(c_Pair(c_UNITY_OInit(X1,X2),c_Pair(c_UNITY_OActs(X1,X2),c_UNITY_OAllowedActs(X1,X2),tc_set(tc_set(tc_prod(X2,X2))),tc_set(tc_set(tc_prod(X2,X2)))),tc_set(X2),tc_prod(tc_set(tc_set(tc_prod(X2,X2))),tc_set(tc_set(tc_prod(X2,X2))))),X2) = X1,
cls_UNITY_Osurjective__mk__program_0 ).
cnf(c_0_7,negated_conjecture,
c_UNITY_OAllowedActs(v_F,t_a) = c_UNITY_OAllowedActs(v_G,t_a),
cls_conjecture_2 ).
cnf(c_0_8,negated_conjecture,
c_UNITY_OInit(v_F,t_a) = c_UNITY_OInit(v_G,t_a),
cls_conjecture_0 ).
cnf(c_0_9,negated_conjecture,
c_UNITY_OActs(v_F,t_a) = c_UNITY_OActs(v_G,t_a),
cls_conjecture_1 ).
cnf(c_0_10,negated_conjecture,
v_F != v_G,
c_0_5 ).
cnf(c_0_11,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]),c_0_9]),c_0_6]),c_0_10]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : COM010-1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n020.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 14:15:03 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.43 Running first-order theorem proving
% 0.13/0.43 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.54/0.62 % Version: 3.5.1
% 0.54/0.62 % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.54/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.54/0.62 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.54/0.62 % Starting new_bool_3 with 300s (1) cores
% 0.54/0.62 % Starting new_bool_1 with 300s (1) cores
% 0.54/0.62 % Starting sh5l with 300s (1) cores
% 0.54/0.62 % new_bool_3 with pid 3145700 completed with status 0
% 0.54/0.62 % Result found by new_bool_3
% 0.54/0.62 % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.54/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.54/0.62 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.54/0.62 % Starting new_bool_3 with 300s (1) cores
% 0.54/0.62 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.54/0.62 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.54/0.62 % Search class: FGHSM-FSLS32-DFFFFFNN
% 0.54/0.62 % Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.54/0.62 % Starting SubtermCWHack with 31s (1) cores
% 0.54/0.62 % SubtermCWHack with pid 3145703 completed with status 0
% 0.54/0.62 % Result found by SubtermCWHack
% 0.54/0.63 % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.54/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.54/0.63 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.54/0.63 % Starting new_bool_3 with 300s (1) cores
% 0.54/0.63 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.54/0.63 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.54/0.63 % Search class: FGHSM-FSLS32-DFFFFFNN
% 0.54/0.63 % Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.54/0.63 % Starting SubtermCWHack with 31s (1) cores
% 0.54/0.63 % Preprocessing time : 0.005 s
% 0.54/0.63
% 0.54/0.63 % Proof found!
% 0.54/0.63 % SZS status Unsatisfiable
% 0.54/0.63 % SZS output start CNFRefutation
% See solution above
% 0.54/0.63 % Parsed axioms : 2740
% 0.54/0.63 % Removed by relevancy pruning/SinE : 2499
% 0.54/0.63 % Initial clauses : 241
% 0.54/0.63 % Removed in clause preprocessing : 0
% 0.54/0.63 % Initial clauses in saturation : 241
% 0.54/0.63 % Processed clauses : 1573
% 0.54/0.63 % ...of these trivial : 55
% 0.54/0.63 % ...subsumed : 949
% 0.54/0.63 % ...remaining for further processing : 569
% 0.54/0.63 % Other redundant clauses eliminated : 13
% 0.54/0.63 % Clauses deleted for lack of memory : 0
% 0.54/0.63 % Backward-subsumed : 55
% 0.54/0.63 % Backward-rewritten : 17
% 0.54/0.63 % Generated clauses : 6278
% 0.54/0.63 % ...of the previous two non-redundant : 4105
% 0.54/0.63 % ...aggressively subsumed : 0
% 0.54/0.63 % Contextual simplify-reflections : 1
% 0.54/0.63 % Paramodulations : 6248
% 0.54/0.63 % Factorizations : 6
% 0.54/0.63 % NegExts : 0
% 0.54/0.63 % Equation resolutions : 24
% 0.54/0.63 % Disequality decompositions : 0
% 0.54/0.63 % Total rewrite steps : 2915
% 0.54/0.63 % ...of those cached : 2460
% 0.54/0.63 % Propositional unsat checks : 0
% 0.54/0.63 % Propositional check models : 0
% 0.54/0.63 % Propositional check unsatisfiable : 0
% 0.54/0.63 % Propositional clauses : 0
% 0.54/0.63 % Propositional clauses after purity: 0
% 0.54/0.63 % Propositional unsat core size : 0
% 0.54/0.63 % Propositional preprocessing time : 0.000
% 0.54/0.63 % Propositional encoding time : 0.000
% 0.54/0.63 % Propositional solver time : 0.000
% 0.54/0.63 % Success case prop preproc time : 0.000
% 0.54/0.63 % Success case prop encoding time : 0.000
% 0.54/0.63 % Success case prop solver time : 0.000
% 0.54/0.63 % Current number of processed clauses : 497
% 0.54/0.63 % Positive orientable unit clauses : 145
% 0.54/0.63 % Positive unorientable unit clauses: 1
% 0.54/0.63 % Negative unit clauses : 79
% 0.54/0.63 % Non-unit-clauses : 272
% 0.54/0.63 % Current number of unprocessed clauses: 2674
% 0.54/0.63 % ...number of literals in the above : 6618
% 0.54/0.63 % Current number of archived formulas : 0
% 0.54/0.63 % Current number of archived clauses : 72
% 0.54/0.63 % Clause-clause subsumption calls (NU) : 13565
% 0.54/0.63 % Rec. Clause-clause subsumption calls : 7539
% 0.54/0.63 % Non-unit clause-clause subsumptions : 287
% 0.54/0.63 % Unit Clause-clause subsumption calls : 6184
% 0.54/0.63 % Rewrite failures with RHS unbound : 0
% 0.54/0.63 % BW rewrite match attempts : 229
% 0.54/0.63 % BW rewrite match successes : 54
% 0.54/0.63 % Condensation attempts : 0
% 0.54/0.63 % Condensation successes : 0
% 0.54/0.63 % Termbank termtop insertions : 95766
% 0.54/0.63 % Search garbage collected termcells : 7549
% 0.54/0.63
% 0.54/0.63 % -------------------------------------------------
% 0.54/0.63 % User time : 0.112 s
% 0.54/0.63 % System time : 0.008 s
% 0.54/0.63 % Total time : 0.121 s
% 0.54/0.63 % Maximum resident set size: 6164 pages
% 0.54/0.63
% 0.54/0.63 % -------------------------------------------------
% 0.54/0.63 % User time : 0.165 s
% 0.54/0.63 % System time : 0.013 s
% 0.54/0.63 % Total time : 0.178 s
% 0.54/0.63 % Maximum resident set size: 6656 pages
% 0.54/0.63 % E exiting
%------------------------------------------------------------------------------