%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NLP260+1 : TPTP v9.3.1. Bugfixed v4.0.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n012.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:35:59 PM UTC 2026
% Result : Theorem 0.15s 15.53s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 14 ( 10 unt; 0 def)
% Number of atoms : 21 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 16 ( 9 ~; 5 |; 1 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 10 ( 0 sgn 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(hypernym_transitiviy_1,conjecture,
hypernym(n9986904,n9855630),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hypernym_transitiviy_1) ).
fof(axiom1,axiom,
! [X1,X2,X3] :
( ( hypernym(X2,X3)
& hypernym(X1,X2) )
=> hypernym(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom1) ).
fof(kb340304,axiom,
hypernym(n10126424,n9855630),
file('/export/starexec/sandbox2/benchmark/Axioms/NLP001+0.ax',kb340304) ).
fof(kb1049,axiom,
hypernym(n9986904,n10126424),
file('/export/starexec/sandbox2/benchmark/Axioms/NLP001+0.ax',kb1049) ).
fof(c_0_4,negated_conjecture,
~ hypernym(n9986904,n9855630),
inference(assume_negation,[status(cth)],[hypernym_transitiviy_1]) ).
fof(c_0_5,plain,
! [X4,X5,X6] :
( hypernym(X4,X6)
| ~ hypernym(X5,X6)
| ~ hypernym(X4,X5) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom1])])]) ).
fof(c_0_6,negated_conjecture,
~ hypernym(n9986904,n9855630),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( ~ hypernym(X2,X3)
| ~ hypernym(X1,X2)
| hypernym(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
hypernym(n10126424,n9855630),
inference(split_conjunct,[status(thm)],[kb340304]) ).
fof(c_0_9,negated_conjecture,
~ hypernym(n9986904,n9855630),
inference(fof_nnf,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( ~ hypernym(X1,n10126424)
| hypernym(X1,n9855630) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,plain,
hypernym(n9986904,n10126424),
inference(split_conjunct,[status(thm)],[kb1049]) ).
cnf(c_0_12,negated_conjecture,
~ hypernym(n9986904,n9855630),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NLP260+1 : TPTP v9.3.1. Bugfixed v4.0.1.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.37 % Computer : n012.cluster.edu
% 0.08/0.37 % Model : x86_64 x86_64
% 0.08/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.37 % Memory : 8046.5625MB
% 0.08/0.37 % OS : Linux 6.8.0-71-generic
% 0.08/0.37 % CPULimit : 300
% 0.08/0.37 % WCLimit : 300
% 0.08/0.37 % DateTime : Mon Sep 21 01:55:52 UTC 2026
% 0.08/0.37 % CPUTime :
% 0.08/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.41 Running first-order theorem proving
% 0.08/0.41 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.15/15.53 % Version: 3.5.1
% 0.15/15.53 % Preprocessing class: FLLLSMSLSSSNFFN.
% 0.15/15.53 % Scheduled 4 strats onto 8 cores with 290 seconds (2320 total)
% 0.15/15.53 % Starting G-E--_300_C01_S5PRR_S00 with 1450s (5) cores
% 0.15/15.53 % Starting new_bool_3 with 290s (1) cores
% 0.15/15.53 % Starting new_bool_1 with 290s (1) cores
% 0.15/15.53 % Starting sh5l with 290s (1) cores
% 0.15/15.53 % new_bool_1 with pid 1345048 completed with status 0
% 0.15/15.53 % Result found by new_bool_1
% 0.15/15.53 % Preprocessing class: FLLLSMSLSSSNFFN.
% 0.15/15.53 % Scheduled 4 strats onto 8 cores with 290 seconds (2320 total)
% 0.15/15.53 % Starting G-E--_300_C01_S5PRR_S00 with 1450s (5) cores
% 0.15/15.53 % Starting new_bool_3 with 290s (1) cores
% 0.15/15.53 % Starting new_bool_1 with 290s (1) cores
% 0.15/15.53 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/15.53 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/15.53 % Search class: FHUNF-FFMM00-SFFFFFNN
% 0.15/15.53 % Scheduled 5 strats onto 1 cores with 287 seconds (287 total)
% 0.15/15.53 % Starting SubtermCWHack with 29s (1) cores
% 0.15/15.53 % SubtermCWHack with pid 1345078 completed with status 0
% 0.15/15.53 % Result found by SubtermCWHack
% 0.15/15.53 % Preprocessing class: FLLLSMSLSSSNFFN.
% 0.15/15.53 % Scheduled 4 strats onto 8 cores with 290 seconds (2320 total)
% 0.15/15.53 % Starting G-E--_300_C01_S5PRR_S00 with 1450s (5) cores
% 0.15/15.53 % Starting new_bool_3 with 290s (1) cores
% 0.15/15.53 % Starting new_bool_1 with 290s (1) cores
% 0.15/15.53 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/15.53 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/15.53 % Search class: FHUNF-FFMM00-SFFFFFNN
% 0.15/15.53 % Scheduled 5 strats onto 1 cores with 287 seconds (287 total)
% 0.15/15.53 % Starting SubtermCWHack with 29s (1) cores
% 0.15/15.53 % Preprocessing time : 0.663 s
% 0.15/15.53
% 0.15/15.53 % Proof found!
% 0.15/15.53 % SZS status Theorem
% 0.15/15.53 % SZS output start CNFRefutation
% See solution above
% 0.15/15.53 % Parsed axioms : 1026861
% 0.15/15.53 % Removed by relevancy pruning/SinE : 1026772
% 0.15/15.53 % Initial clauses : 89
% 0.15/15.53 % Removed in clause preprocessing : 0
% 0.15/15.53 % Initial clauses in saturation : 89
% 0.15/15.53 % Processed clauses : 109
% 0.15/15.53 % ...of these trivial : 0
% 0.15/15.53 % ...subsumed : 0
% 0.15/15.53 % ...remaining for further processing : 109
% 0.15/15.53 % Other redundant clauses eliminated : 0
% 0.15/15.53 % Clauses deleted for lack of memory : 0
% 0.15/15.53 % Backward-subsumed : 0
% 0.15/15.53 % Backward-rewritten : 0
% 0.15/15.53 % Generated clauses : 46
% 0.15/15.53 % ...of the previous two non-redundant : 26
% 0.15/15.53 % ...aggressively subsumed : 0
% 0.15/15.53 % Contextual simplify-reflections : 0
% 0.15/15.53 % Paramodulations : 46
% 0.15/15.53 % Factorizations : 0
% 0.15/15.53 % NegExts : 0
% 0.15/15.53 % Equation resolutions : 0
% 0.15/15.53 % Disequality decompositions : 0
% 0.15/15.53 % Total rewrite steps : 18
% 0.15/15.53 % ...of those cached : 0
% 0.15/15.53 % Propositional unsat checks : 0
% 0.15/15.53 % Propositional check models : 0
% 0.15/15.53 % Propositional check unsatisfiable : 0
% 0.15/15.53 % Propositional clauses : 0
% 0.15/15.53 % Propositional clauses after purity: 0
% 0.15/15.53 % Propositional unsat core size : 0
% 0.15/15.53 % Propositional preprocessing time : 0.000
% 0.15/15.53 % Propositional encoding time : 0.000
% 0.15/15.53 % Propositional solver time : 0.000
% 0.15/15.53 % Success case prop preproc time : 0.000
% 0.15/15.53 % Success case prop encoding time : 0.000
% 0.15/15.53 % Success case prop solver time : 0.000
% 0.15/15.53 % Current number of processed clauses : 109
% 0.15/15.53 % Positive orientable unit clauses : 88
% 0.15/15.53 % Positive unorientable unit clauses: 0
% 0.15/15.53 % Negative unit clauses : 1
% 0.15/15.53 % Non-unit-clauses : 20
% 0.15/15.53 % Current number of unprocessed clauses: 6
% 0.15/15.53 % ...number of literals in the above : 14
% 0.15/15.53 % Current number of archived formulas : 0
% 0.15/15.53 % Current number of archived clauses : 0
% 0.15/15.53 % Clause-clause subsumption calls (NU) : 68
% 0.15/15.53 % Rec. Clause-clause subsumption calls : 68
% 0.15/15.53 % Non-unit clause-clause subsumptions : 0
% 0.15/15.53 % Unit Clause-clause subsumption calls : 3
% 0.15/15.53 % Rewrite failures with RHS unbound : 0
% 0.15/15.53 % BW rewrite match attempts : 0
% 0.15/15.53 % BW rewrite match successes : 0
% 0.15/15.53 % Condensation attempts : 0
% 0.15/15.53 % Condensation successes : 0
% 0.15/15.53 % Termbank termtop insertions : 4109329
% 0.15/15.53 % Search garbage collected termcells : 2410677
% 0.15/15.53
% 0.15/15.53 % -------------------------------------------------
% 0.15/15.53 % User time : 2.384 s
% 0.15/15.53 % System time : 1.379 s
% 0.15/15.53 % Total time : 3.762 s
% 0.15/15.53 % Maximum resident set size: 1441268 pages
% 0.15/15.53
% 0.15/15.53 % -------------------------------------------------
% 0.15/15.53 % User time : 12.652 s
% 0.15/15.53 % System time : 2.121 s
% 0.15/15.53 % Total time : 14.773 s
% 0.15/15.53 % Maximum resident set size: 602624 pages
% 0.15/15.53 % E exiting
%------------------------------------------------------------------------------