%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : KRS067+1 : TPTP v9.3.1. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n008.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 01:00:41 PM UTC 2026
% Result : Unsatisfiable 0.21s 15.58s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 22 ( 4 unt; 0 def)
% Number of atoms : 96 ( 0 equ)
% Maximal formula atoms : 41 ( 4 avg)
% Number of connectives : 112 ( 38 ~; 56 |; 14 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 19 ( 1 sgn 7 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_2,axiom,
! [X1] :
( cUnsatisfiable(X1)
<=> ( ( ca(X1)
& cc(X1) )
| ( ca(X1)
& cb(X1) )
| ( cb(X1)
& cc(X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
fof(axiom_3,axiom,
! [X1] :
( ca(X1)
=> ~ ( cb(X1)
| cc(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).
fof(axiom_4,axiom,
! [X1] :
( cb(X1)
=> ~ cc(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_4) ).
fof(axiom_5,axiom,
cUnsatisfiable(i2003_11_14_17_18_1956),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_5) ).
fof(c_0_4,plain,
! [X4] :
( ( cUnsatisfiable(X4)
| ~ ca(X4)
| ~ cc(X4) )
& ( cUnsatisfiable(X4)
| ~ ca(X4)
| ~ cb(X4) )
& ( cUnsatisfiable(X4)
| ~ cb(X4)
| ~ cc(X4) )
& ( ~ cUnsatisfiable(X4)
| cb(X4)
| ca(X4)
| ca(X4) )
& ( ~ cUnsatisfiable(X4)
| cb(X4)
| ca(X4)
| cc(X4) )
& ( ~ cUnsatisfiable(X4)
| cb(X4)
| cb(X4)
| ca(X4) )
& ( ~ cUnsatisfiable(X4)
| cb(X4)
| cb(X4)
| cc(X4) )
& ( ~ cUnsatisfiable(X4)
| cc(X4)
| ca(X4)
| ca(X4) )
& ( ~ cUnsatisfiable(X4)
| cc(X4)
| ca(X4)
| cc(X4) )
& ( ~ cUnsatisfiable(X4)
| cc(X4)
| cb(X4)
| ca(X4) )
& ( ~ cUnsatisfiable(X4)
| cc(X4)
| cb(X4)
| cc(X4) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_2])])])]) ).
fof(c_0_5,plain,
! [X5] :
( ( ~ ca(X5)
| ~ cb(X5) )
& ( ~ ca(X5)
| ~ cc(X5) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_3])])])]) ).
cnf(c_0_6,plain,
( ~ cUnsatisfiable(X1)
| cc(X1)
| ca(X1)
| ca(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( ~ cUnsatisfiable(X1)
| cb(X1)
| cb(X1)
| cc(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_8,plain,
! [X1] :
( cb(X1)
=> ~ cc(X1) ),
inference(fof_simplification,[status(thm)],[axiom_4]) ).
cnf(c_0_9,plain,
( ~ cUnsatisfiable(X1)
| cb(X1)
| ca(X1)
| ca(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_10,plain,
( ~ ca(X1)
| ~ cb(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,plain,
( ~ cUnsatisfiable(X1)
| ca(X1)
| cc(X1) ),
inference(cn,[status(thm)],[c_0_6]) ).
cnf(c_0_12,plain,
( ~ cUnsatisfiable(X1)
| cb(X1)
| cc(X1) ),
inference(cn,[status(thm)],[c_0_7]) ).
fof(c_0_13,plain,
! [X6] :
( ~ cc(X6)
| ~ cb(X6) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
cnf(c_0_14,plain,
( ~ ca(X1)
| ~ cc(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_15,plain,
( ~ cUnsatisfiable(X1)
| ca(X1)
| cb(X1) ),
inference(cn,[status(thm)],[c_0_9]) ).
cnf(c_0_16,plain,
( ~ cUnsatisfiable(X1)
| cc(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
cnf(c_0_17,plain,
( ~ cc(X1)
| ~ cb(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
( ~ cUnsatisfiable(X1)
| cb(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_19,plain,
cUnsatisfiable(i2003_11_14_17_18_1956),
inference(split_conjunct,[status(thm)],[axiom_5]) ).
cnf(c_0_20,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_16]) ).
cnf(c_0_21,plain,
$false,
inference(sr,[status(thm)],[c_0_19,c_0_20]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : KRS067+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.21/15.51 % Computer : n008.cluster.edu
% 0.21/15.51 % Model : x86_64 x86_64
% 0.21/15.51 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.21/15.51 % Memory : 8046.5625MB
% 0.21/15.51 % OS : Linux 6.8.0-71-generic
% 0.21/15.51 % CPULimit : 300
% 0.21/15.51 % WCLimit : 300
% 0.21/15.51 % DateTime : Sun Sep 20 22:54:11 UTC 2026
% 0.21/15.52 % CPUTime :
% 0.21/15.52 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.21/15.56 Running first-order theorem proving
% 0.21/15.56 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.21/15.58 % Version: 3.5.1
% 0.21/15.58 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/15.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/15.58 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/15.58 % Starting new_bool_3 with 300s (1) cores
% 0.21/15.58 % Starting new_bool_1 with 300s (1) cores
% 0.21/15.58 % Starting sh5l with 300s (1) cores
% 0.21/15.58 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 3775320 completed with status 0
% 0.21/15.58 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.21/15.58 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/15.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/15.58 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/15.58 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.21/15.58 % No SInE strategy applied
% 0.21/15.58 % Search class: FGHNF-FFSF00-SFFFFFNN
% 0.21/15.58 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/15.58 % Starting SubtermCWHack with 136s (1) cores
% 0.21/15.58 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.21/15.58 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.21/15.58 % Starting new_bool_3 with 136s (1) cores
% 0.21/15.58 % Starting new_bool_1 with 136s (1) cores
% 0.21/15.58 % SubtermCWHack with pid 3775330 completed with status 0
% 0.21/15.58 % Result found by SubtermCWHack
% 0.21/15.58 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/15.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/15.58 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/15.58 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.21/15.58 % No SInE strategy applied
% 0.21/15.58 % Search class: FGHNF-FFSF00-SFFFFFNN
% 0.21/15.58 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/15.58 % Starting SubtermCWHack with 136s (1) cores
% 0.21/15.58 % Preprocessing time : 0.001 s
% 0.21/15.58
% 0.21/15.58 % Proof found!
% 0.21/15.58 % SZS status Unsatisfiable
% 0.21/15.58 % SZS output start CNFRefutation
% See solution above
% 0.21/15.58 % Parsed axioms : 6
% 0.21/15.58 % Removed by relevancy pruning/SinE : 0
% 0.21/15.58 % Initial clauses : 19
% 0.21/15.58 % Removed in clause preprocessing : 1
% 0.21/15.58 % Initial clauses in saturation : 18
% 0.21/15.58 % Processed clauses : 19
% 0.21/15.58 % ...of these trivial : 0
% 0.21/15.58 % ...subsumed : 6
% 0.21/15.58 % ...remaining for further processing : 13
% 0.21/15.58 % Other redundant clauses eliminated : 0
% 0.21/15.58 % Clauses deleted for lack of memory : 0
% 0.21/15.58 % Backward-subsumed : 5
% 0.21/15.58 % Backward-rewritten : 0
% 0.21/15.58 % Generated clauses : 8
% 0.21/15.58 % ...of the previous two non-redundant : 3
% 0.21/15.58 % ...aggressively subsumed : 0
% 0.21/15.58 % Contextual simplify-reflections : 3
% 0.21/15.58 % Paramodulations : 7
% 0.21/15.58 % Factorizations : 0
% 0.21/15.58 % NegExts : 0
% 0.21/15.58 % Equation resolutions : 0
% 0.21/15.58 % Disequality decompositions : 0
% 0.21/15.58 % Total rewrite steps : 0
% 0.21/15.58 % ...of those cached : 0
% 0.21/15.58 % Propositional unsat checks : 0
% 0.21/15.58 % Propositional check models : 0
% 0.21/15.58 % Propositional check unsatisfiable : 0
% 0.21/15.58 % Propositional clauses : 0
% 0.21/15.58 % Propositional clauses after purity: 0
% 0.21/15.58 % Propositional unsat core size : 0
% 0.21/15.58 % Propositional preprocessing time : 0.000
% 0.21/15.58 % Propositional encoding time : 0.000
% 0.21/15.58 % Propositional solver time : 0.000
% 0.21/15.58 % Success case prop preproc time : 0.000
% 0.21/15.58 % Success case prop encoding time : 0.000
% 0.21/15.58 % Success case prop solver time : 0.000
% 0.21/15.58 % Current number of processed clauses : 7
% 0.21/15.58 % Positive orientable unit clauses : 0
% 0.21/15.58 % Positive unorientable unit clauses: 0
% 0.21/15.58 % Negative unit clauses : 2
% 0.21/15.58 % Non-unit-clauses : 5
% 0.21/15.58 % Current number of unprocessed clauses: 2
% 0.21/15.58 % ...number of literals in the above : 8
% 0.21/15.58 % Current number of archived formulas : 0
% 0.21/15.58 % Current number of archived clauses : 7
% 0.21/15.58 % Clause-clause subsumption calls (NU) : 12
% 0.21/15.58 % Rec. Clause-clause subsumption calls : 12
% 0.21/15.58 % Non-unit clause-clause subsumptions : 12
% 0.21/15.58 % Unit Clause-clause subsumption calls : 2
% 0.21/15.58 % Rewrite failures with RHS unbound : 0
% 0.21/15.58 % BW rewrite match attempts : 0
% 0.21/15.58 % BW rewrite match successes : 0
% 0.21/15.58 % Condensation attempts : 0
% 0.21/15.58 % Condensation successes : 0
% 0.21/15.58 % Termbank termtop insertions : 851
% 0.21/15.58 % Search garbage collected termcells : 140
% 0.21/15.58
% 0.21/15.58 % -------------------------------------------------
% 0.21/15.58 % User time : 0.004 s
% 0.21/15.58 % System time : 0.003 s
% 0.21/15.58 % Total time : 0.007 s
% 0.21/15.58 % Maximum resident set size: 3576 pages
% 0.21/15.58
% 0.21/15.58 % -------------------------------------------------
% 0.21/15.58 % User time : 0.010 s
% 0.21/15.58 % System time : 0.013 s
% 0.21/15.58 % Total time : 0.023 s
% 0.21/15.58 % Maximum resident set size: 4608 pages
% 0.21/15.58 % E exiting
%------------------------------------------------------------------------------