%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : KRS180+1 : TPTP v9.3.1. Bugfixed v5.4.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:01:06 PM UTC 2026
% Result : Theorem 0.12s 0.45s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 29 ( 6 unt; 0 def)
% Number of atoms : 97 ( 0 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 108 ( 40 ~; 39 |; 15 &)
% ( 8 <=>; 5 =>; 0 <=; 1 <~>)
% Maximal formula depth : 15 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 2 con; 0-2 aty)
% Number of variables : 92 ( 11 sgn 56 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(isa_exclusive,conjecture,
! [X1,X2] :
? [X3,X4] :
( status(X3,X4,X1)
=> ~ ( ( xora(X1,X2)
| nevera(X1,X2)
| nota(X1,X2) )
& isa(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',isa_exclusive) ).
fof(isa,axiom,
! [X1,X2] :
( ! [X3,X4] :
( status(X3,X4,X1)
=> status(X3,X4,X2) )
<=> isa(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KRS001+1.ax',isa) ).
fof(nota,axiom,
! [X1,X2] :
( ? [X3,X4] :
( ~ status(X3,X4,X2)
& status(X3,X4,X1) )
<=> nota(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KRS001+1.ax',nota) ).
fof(nevera,axiom,
! [X1,X2] :
( ! [X3,X4] :
( status(X3,X4,X1)
=> ~ status(X3,X4,X2) )
<=> nevera(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KRS001+1.ax',nevera) ).
fof(xora,axiom,
! [X1,X2] :
( ! [X3,X4] :
( status(X3,X4,X1)
<~> status(X3,X4,X2) )
<=> xora(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KRS001+1.ax',xora) ).
fof(c_0_5,negated_conjecture,
~ ! [X1,X2] :
? [X3,X4] :
( status(X3,X4,X1)
=> ~ ( ( xora(X1,X2)
| nevera(X1,X2)
| nota(X1,X2) )
& isa(X1,X2) ) ),
inference(assume_negation,[status(cth)],[isa_exclusive]) ).
fof(c_0_6,plain,
! [X41,X42,X45,X46,X47,X48] :
( ( status(X47,X48,X46)
| ~ status(X47,X48,X45)
| ~ isa(X45,X46) )
& ( isa(X41,X42)
| ~ status(esk9_2(X41,X42),esk10_2(X41,X42),X42) )
& ( isa(X41,X42)
| status(esk9_2(X41,X42),esk10_2(X41,X42),X41) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[isa])])])])])])]) ).
fof(c_0_7,negated_conjecture,
! [X13,X14] :
( ( xora(esk1_0,esk2_0)
| nevera(esk1_0,esk2_0)
| nota(esk1_0,esk2_0) )
& isa(esk1_0,esk2_0)
& status(X13,X14,esk1_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
fof(c_0_8,plain,
! [X1,X2] :
( ? [X3,X4] :
( ~ status(X3,X4,X2)
& status(X3,X4,X1) )
<=> nota(X1,X2) ),
inference(fof_simplification,[status(thm)],[nota]) ).
cnf(c_0_9,plain,
( ~ status(X3,X4,X1)
| ~ isa(X1,X2)
| status(X3,X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
status(X1,X2,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_11,plain,
! [X1,X2] :
( ! [X3,X4] :
( status(X3,X4,X1)
=> ~ status(X3,X4,X2) )
<=> nevera(X1,X2) ),
inference(fof_simplification,[status(thm)],[nevera]) ).
fof(c_0_12,plain,
! [X33,X34,X35,X36,X37,X38] :
( ( ~ nota(X37,X38)
| ~ status(esk7_2(X37,X38),esk8_2(X37,X38),X38) )
& ( ~ nota(X37,X38)
| status(esk7_2(X37,X38),esk8_2(X37,X38),X37) )
& ( nota(X33,X34)
| status(X35,X36,X34)
| ~ status(X35,X36,X33) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])])])])]) ).
cnf(c_0_13,negated_conjecture,
( ~ isa(esk1_0,X3)
| status(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,negated_conjecture,
isa(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_15,plain,
! [X1,X2] :
( ! [X3,X4] :
~ ( status(X3,X4,X1)
<=> status(X3,X4,X2) )
<=> xora(X1,X2) ),
inference(fof_simplification,[status(thm)],[xora]) ).
fof(c_0_16,plain,
! [X25,X26,X29,X30,X31,X32] :
( ( ~ status(X31,X32,X30)
| ~ status(X31,X32,X29)
| ~ nevera(X29,X30) )
& ( nevera(X25,X26)
| status(esk5_2(X25,X26),esk6_2(X25,X26),X26) )
& ( nevera(X25,X26)
| status(esk5_2(X25,X26),esk6_2(X25,X26),X25) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])])])])]) ).
cnf(c_0_17,plain,
( ~ nota(X1,X2)
| ~ status(esk7_2(X1,X2),esk8_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,negated_conjecture,
status(X1,X2,esk2_0),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
fof(c_0_19,plain,
! [X15,X16,X19,X20,X21,X22,X23,X24] :
( ( ~ xora(X19,X20)
| status(X23,X24,X20)
| status(X23,X24,X19) )
& ( ~ xora(X19,X20)
| ~ status(X21,X22,X20)
| ~ status(X21,X22,X19) )
& ( xora(X15,X16)
| status(esk3_2(X15,X16),esk4_2(X15,X16),X15)
| ~ status(esk3_2(X15,X16),esk4_2(X15,X16),X16) )
& ( xora(X15,X16)
| status(esk3_2(X15,X16),esk4_2(X15,X16),X16)
| ~ status(esk3_2(X15,X16),esk4_2(X15,X16),X15) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])])])])])]) ).
cnf(c_0_20,plain,
( ~ status(X3,X4,X2)
| ~ status(X3,X4,X1)
| ~ nevera(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,negated_conjecture,
( xora(esk1_0,esk2_0)
| nevera(esk1_0,esk2_0)
| nota(esk1_0,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_22,negated_conjecture,
~ nota(X1,esk2_0),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,plain,
( ~ xora(X3,X4)
| ~ status(X1,X2,X4)
| ~ status(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_24,negated_conjecture,
( ~ status(X2,X3,X1)
| ~ nevera(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_20,c_0_18]) ).
cnf(c_0_25,negated_conjecture,
( nevera(esk1_0,esk2_0)
| xora(esk1_0,esk2_0) ),
inference(sr,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,negated_conjecture,
( ~ status(X2,X3,X1)
| ~ xora(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_23,c_0_18]) ).
cnf(c_0_27,negated_conjecture,
xora(esk1_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_10])]) ).
cnf(c_0_28,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_10])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KRS180+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.37 % Computer : n008.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Sun Sep 20 22:56:39 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/0.42 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.12/0.45 % Version: 3.5.1
% 0.12/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.45 % Starting sh5l with 300s (1) cores
% 0.12/0.45 % new_bool_3 with pid 3781569 completed with status 0
% 0.12/0.45 % Result found by new_bool_3
% 0.12/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.12/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.45 % Search class: FGHNF-FFSF22-SFFFFFNN
% 0.12/0.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.45 % Starting SubtermCWHack with 31s (1) cores
% 0.12/0.45 % SubtermCWHack with pid 3781572 completed with status 0
% 0.12/0.45 % Result found by SubtermCWHack
% 0.12/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.12/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.45 % Search class: FGHNF-FFSF22-SFFFFFNN
% 0.12/0.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.45 % Starting SubtermCWHack with 31s (1) cores
% 0.12/0.45 % Preprocessing time : 0.001 s
% 0.12/0.45
% 0.12/0.45 % Proof found!
% 0.12/0.45 % SZS status Theorem
% 0.12/0.45 % SZS output start CNFRefutation
% See solution above
% 0.12/0.45 % Parsed axioms : 14
% 0.12/0.45 % Removed by relevancy pruning/SinE : 9
% 0.12/0.45 % Initial clauses : 16
% 0.12/0.45 % Removed in clause preprocessing : 0
% 0.12/0.45 % Initial clauses in saturation : 16
% 0.12/0.45 % Processed clauses : 57
% 0.12/0.45 % ...of these trivial : 0
% 0.12/0.45 % ...subsumed : 17
% 0.12/0.45 % ...remaining for further processing : 40
% 0.12/0.45 % Other redundant clauses eliminated : 0
% 0.12/0.45 % Clauses deleted for lack of memory : 0
% 0.12/0.45 % Backward-subsumed : 0
% 0.12/0.45 % Backward-rewritten : 2
% 0.12/0.45 % Generated clauses : 126
% 0.12/0.45 % ...of the previous two non-redundant : 92
% 0.12/0.45 % ...aggressively subsumed : 0
% 0.12/0.45 % Contextual simplify-reflections : 0
% 0.12/0.45 % Paramodulations : 121
% 0.12/0.45 % Factorizations : 4
% 0.12/0.45 % NegExts : 0
% 0.12/0.45 % Equation resolutions : 0
% 0.12/0.45 % Disequality decompositions : 0
% 0.12/0.45 % Total rewrite steps : 38
% 0.12/0.45 % ...of those cached : 26
% 0.12/0.45 % Propositional unsat checks : 0
% 0.12/0.45 % Propositional check models : 0
% 0.12/0.45 % Propositional check unsatisfiable : 0
% 0.12/0.45 % Propositional clauses : 0
% 0.12/0.45 % Propositional clauses after purity: 0
% 0.12/0.45 % Propositional unsat core size : 0
% 0.12/0.45 % Propositional preprocessing time : 0.000
% 0.12/0.45 % Propositional encoding time : 0.000
% 0.12/0.45 % Propositional solver time : 0.000
% 0.12/0.45 % Success case prop preproc time : 0.000
% 0.12/0.45 % Success case prop encoding time : 0.000
% 0.12/0.45 % Success case prop solver time : 0.000
% 0.12/0.45 % Current number of processed clauses : 37
% 0.12/0.45 % Positive orientable unit clauses : 6
% 0.12/0.45 % Positive unorientable unit clauses: 0
% 0.12/0.45 % Negative unit clauses : 3
% 0.12/0.45 % Non-unit-clauses : 28
% 0.12/0.45 % Current number of unprocessed clauses: 51
% 0.12/0.45 % ...number of literals in the above : 161
% 0.12/0.45 % Current number of archived formulas : 0
% 0.12/0.45 % Current number of archived clauses : 3
% 0.12/0.45 % Clause-clause subsumption calls (NU) : 127
% 0.12/0.45 % Rec. Clause-clause subsumption calls : 115
% 0.12/0.45 % Non-unit clause-clause subsumptions : 17
% 0.12/0.45 % Unit Clause-clause subsumption calls : 11
% 0.12/0.45 % Rewrite failures with RHS unbound : 0
% 0.12/0.45 % BW rewrite match attempts : 19
% 0.12/0.45 % BW rewrite match successes : 2
% 0.12/0.45 % Condensation attempts : 0
% 0.12/0.45 % Condensation successes : 0
% 0.12/0.45 % Termbank termtop insertions : 2387
% 0.12/0.45 % Search garbage collected termcells : 496
% 0.12/0.45
% 0.12/0.45 % -------------------------------------------------
% 0.12/0.45 % User time : 0.007 s
% 0.12/0.45 % System time : 0.003 s
% 0.12/0.45 % Total time : 0.010 s
% 0.12/0.45 % Maximum resident set size: 3600 pages
% 0.12/0.45
% 0.12/0.45 % -------------------------------------------------
% 0.12/0.45 % User time : 0.008 s
% 0.12/0.45 % System time : 0.008 s
% 0.12/0.45 % Total time : 0.016 s
% 0.12/0.45 % Maximum resident set size: 4864 pages
% 0.12/0.45 % E exiting
%------------------------------------------------------------------------------