%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : COL052-1 : 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 : n019.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:09:25 PM UTC 2026
% Result : Unsatisfiable 0.27s 0.55s
% Output : CNFRefutation 0.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of clauses : 13 ( 13 unt; 0 nHn; 7 RR)
% Number of literals : 13 ( 12 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 15 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_a_is_agreeable,negated_conjecture,
response(a,X1) != response(odd_bird,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_a_is_agreeable) ).
cnf(agreeable1,hypothesis,
response(c,common_bird(X1)) = response(X1,common_bird(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',agreeable1) ).
cnf(composer_exists,axiom,
response(compose(X1,X2),X3) = response(X1,response(X2,X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',composer_exists) ).
cnf(c_composes_a_with_b,hypothesis,
c = compose(a,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_composes_a_with_b) ).
cnf(c_0_4,negated_conjecture,
response(a,X1) != response(odd_bird,X1),
inference(fof_simplification,[status(thm)],[prove_a_is_agreeable]) ).
cnf(c_0_5,hypothesis,
response(c,common_bird(X1)) = response(X1,common_bird(X1)),
agreeable1 ).
cnf(c_0_6,axiom,
response(compose(X1,X2),X3) = response(X1,response(X2,X3)),
composer_exists ).
cnf(c_0_7,negated_conjecture,
response(a,X1) != response(odd_bird,X1),
c_0_4 ).
cnf(c_0_8,hypothesis,
response(X1,response(X2,common_bird(compose(X1,X2)))) = response(c,common_bird(compose(X1,X2))),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_9,hypothesis,
c = compose(a,b),
c_composes_a_with_b ).
cnf(c_0_10,negated_conjecture,
response(a,response(X1,common_bird(compose(odd_bird,X1)))) != response(c,common_bird(compose(odd_bird,X1))),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,hypothesis,
response(a,response(b,X1)) = response(c,X1),
inference(spm,[status(thm)],[c_0_6,c_0_9]) ).
cnf(c_0_12,hypothesis,
$false,
inference(spm,[status(thm)],[c_0_10,c_0_11]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : COL052-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/0.43 % Computer : n019.cluster.edu
% 0.18/0.43 % Model : x86_64 x86_64
% 0.18/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.43 % Memory : 8046.5625MB
% 0.18/0.43 % OS : Linux 6.8.0-71-generic
% 0.18/0.43 % CPULimit : 300
% 0.18/0.43 % WCLimit : 300
% 0.18/0.43 % DateTime : Mon Sep 21 14:07:19 UTC 2026
% 0.18/0.43 % CPUTime :
% 0.18/0.43 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/0.50 Running first-order theorem proving
% 0.18/0.50 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.27/0.55 % Version: 3.5.1
% 0.27/0.55 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.27/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.55 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.27/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.27/0.55 % Starting new_bool_1 with 300s (1) cores
% 0.27/0.55 % Starting sh5l with 300s (1) cores
% 0.27/0.55 % new_bool_1 with pid 2772116 completed with status 0
% 0.27/0.55 % Result found by new_bool_1
% 0.27/0.55 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.27/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.55 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.27/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.27/0.55 % Starting new_bool_1 with 300s (1) cores
% 0.27/0.55 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.27/0.55 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.27/0.55 % Search class: FUUPS-FFSF21-SFFFFFNN
% 0.27/0.55 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.27/0.55 % Starting SubtermCWHack with 31s (1) cores
% 0.27/0.55 % SubtermCWHack with pid 2772120 completed with status 0
% 0.27/0.55 % Result found by SubtermCWHack
% 0.27/0.55 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.27/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.55 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.27/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.27/0.55 % Starting new_bool_1 with 300s (1) cores
% 0.27/0.55 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.27/0.55 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.27/0.55 % Search class: FUUPS-FFSF21-SFFFFFNN
% 0.27/0.55 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.27/0.55 % Starting SubtermCWHack with 31s (1) cores
% 0.27/0.55 % Preprocessing time : 0.002 s
% 0.27/0.55
% 0.27/0.55 % Proof found!
% 0.27/0.55 % SZS status Unsatisfiable
% 0.27/0.55 % SZS output start CNFRefutation
% See solution above
% 0.27/0.55 % Parsed axioms : 4
% 0.27/0.55 % Removed by relevancy pruning/SinE : 0
% 0.27/0.55 % Initial clauses : 4
% 0.27/0.55 % Removed in clause preprocessing : 0
% 0.27/0.55 % Initial clauses in saturation : 4
% 0.27/0.55 % Processed clauses : 9
% 0.27/0.55 % ...of these trivial : 0
% 0.27/0.55 % ...subsumed : 0
% 0.27/0.55 % ...remaining for further processing : 9
% 0.27/0.55 % Other redundant clauses eliminated : 0
% 0.27/0.55 % Clauses deleted for lack of memory : 0
% 0.27/0.55 % Backward-subsumed : 0
% 0.27/0.55 % Backward-rewritten : 0
% 0.27/0.55 % Generated clauses : 11
% 0.27/0.55 % ...of the previous two non-redundant : 9
% 0.27/0.55 % ...aggressively subsumed : 0
% 0.27/0.55 % Contextual simplify-reflections : 0
% 0.27/0.55 % Paramodulations : 11
% 0.27/0.55 % Factorizations : 0
% 0.27/0.55 % NegExts : 0
% 0.27/0.55 % Equation resolutions : 0
% 0.27/0.55 % Disequality decompositions : 0
% 0.27/0.55 % Total rewrite steps : 1
% 0.27/0.55 % ...of those cached : 0
% 0.27/0.55 % Propositional unsat checks : 0
% 0.27/0.55 % Propositional check models : 0
% 0.27/0.55 % Propositional check unsatisfiable : 0
% 0.27/0.55 % Propositional clauses : 0
% 0.27/0.55 % Propositional clauses after purity: 0
% 0.27/0.55 % Propositional unsat core size : 0
% 0.27/0.55 % Propositional preprocessing time : 0.000
% 0.27/0.55 % Propositional encoding time : 0.000
% 0.27/0.55 % Propositional solver time : 0.000
% 0.27/0.55 % Success case prop preproc time : 0.000
% 0.27/0.55 % Success case prop encoding time : 0.000
% 0.27/0.55 % Success case prop solver time : 0.000
% 0.27/0.55 % Current number of processed clauses : 9
% 0.27/0.55 % Positive orientable unit clauses : 5
% 0.27/0.55 % Positive unorientable unit clauses: 1
% 0.27/0.55 % Negative unit clauses : 3
% 0.27/0.55 % Non-unit-clauses : 0
% 0.27/0.55 % Current number of unprocessed clauses: 3
% 0.27/0.55 % ...number of literals in the above : 3
% 0.27/0.55 % Current number of archived formulas : 0
% 0.27/0.55 % Current number of archived clauses : 0
% 0.27/0.55 % Clause-clause subsumption calls (NU) : 0
% 0.27/0.55 % Rec. Clause-clause subsumption calls : 0
% 0.27/0.55 % Non-unit clause-clause subsumptions : 0
% 0.27/0.55 % Unit Clause-clause subsumption calls : 0
% 0.27/0.55 % Rewrite failures with RHS unbound : 0
% 0.27/0.55 % BW rewrite match attempts : 1
% 0.27/0.55 % BW rewrite match successes : 0
% 0.27/0.55 % Condensation attempts : 0
% 0.27/0.55 % Condensation successes : 0
% 0.27/0.55 % Termbank termtop insertions : 290
% 0.27/0.55 % Search garbage collected termcells : 2
% 0.27/0.55
% 0.27/0.55 % -------------------------------------------------
% 0.27/0.55 % User time : 0.005 s
% 0.27/0.55 % System time : 0.001 s
% 0.27/0.55 % Total time : 0.006 s
% 0.27/0.55 % Maximum resident set size: 3628 pages
% 0.27/0.55
% 0.27/0.55 % -------------------------------------------------
% 0.27/0.55 % User time : 0.007 s
% 0.27/0.55 % System time : 0.009 s
% 0.27/0.55 % Total time : 0.015 s
% 0.27/0.55 % Maximum resident set size: 4864 pages
% 0.27/0.55 % E exiting
%------------------------------------------------------------------------------