%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : NLP267_17 : TPTP v9.3.1. Released v8.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n007.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:38:28 PM UTC 2026
% Result : Theorem 0.14s 0.63s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 18 ( 8 unt; 0 typ; 0 def)
% Number of atoms : 37 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 32 ( 13 ~; 10 |; 4 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 4 ( 2 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 18 ( 0 sgn 18 !; 0 ?; 18 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_sort1,type,
'$ki_world': $tType ).
tff(decl_sort2,type,
'$ki_index': $tType ).
tff(decl_23,type,
'$ki_local_world': '$ki_world' ).
tff(decl_24,type,
'$ki_accessible': ( '$ki_world' * ( '$ki_world' * '$ki_index' ) ) > $o ).
tff(decl_25,type,
'#idx(b_s)': '$ki_index' ).
tff(decl_27,type,
seventy: $i ).
tff(decl_29,type,
second: $i ).
tff(decl_30,type,
paris: $i ).
tff(decl_32,type,
price: ( $i * '$ki_world' ) > $o ).
tff(decl_33,type,
dest: ( $i * '$ki_world' ) > $o ).
tff(decl_34,type,
class: ( $i * '$ki_world' ) > $o ).
tff(decl_35,type,
esk1_0: '$ki_world' ).
tff(axiom_5,axiom,
! [X1: '$ki_world'] :
( '$ki_accessible'('#idx(b_s)','$ki_local_world',X1)
=> ( class(X1,second)
& dest(X1,paris) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_5) ).
tff('mrel_universal_#idx(b_s)',axiom,
! [X1: '$ki_world',X2: '$ki_world'] : '$ki_accessible'('#idx(b_s)',X1,X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','mrel_universal_#idx(b_s)') ).
tff(verify,conjecture,
! [X1: '$ki_world'] :
( '$ki_accessible'('#idx(b_s)','$ki_local_world',X1)
=> price(X1,seventy) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',verify) ).
tff(axiom_2,axiom,
! [X1: '$ki_world'] :
( '$ki_accessible'('#idx(b_s)','$ki_local_world',X1)
=> ( ( class(X1,second)
& dest(X1,paris) )
=> price(X1,seventy) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
tff(c_0_4,plain,
! [X11: '$ki_world'] :
( ( ~ '$ki_accessible'('#idx(b_s)','$ki_local_world',X11)
| class(X11,second) )
& ( ~ '$ki_accessible'('#idx(b_s)','$ki_local_world',X11)
| dest(X11,paris) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_5])])])]) ).
tff(c_0_5,plain,
! [X7: '$ki_world',X8: '$ki_world'] : '$ki_accessible'('#idx(b_s)',X7,X8),
inference(variable_rename,[status(thm)],['mrel_universal_#idx(b_s)']) ).
tff(c_0_6,negated_conjecture,
~ ! [X1: '$ki_world'] :
( '$ki_accessible'('#idx(b_s)','$ki_local_world',X1)
=> price(X1,seventy) ),
inference(assume_negation,[status(cth)],[verify]) ).
tff(c_0_7,plain,
! [X4: '$ki_world'] :
( price(X4,seventy)
| ~ class(X4,second)
| ~ dest(X4,paris)
| ~ '$ki_accessible'('#idx(b_s)','$ki_local_world',X4) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_2])])]) ).
tcf(c_0_8,plain,
! [X1: '$ki_world'] :
( ~ '$ki_accessible'('#idx(b_s)','$ki_local_world',X1)
| dest(X1,paris) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
tcf(c_0_9,plain,
! [X1: '$ki_world',X2: '$ki_world'] : '$ki_accessible'('#idx(b_s)',X1,X2),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
tcf(c_0_10,plain,
! [X1: '$ki_world'] :
( ~ '$ki_accessible'('#idx(b_s)','$ki_local_world',X1)
| class(X1,second) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
tff(c_0_11,negated_conjecture,
( ~ price(esk1_0,seventy)
& '$ki_accessible'('#idx(b_s)','$ki_local_world',esk1_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).
tcf(c_0_12,plain,
! [X1: '$ki_world'] :
( ~ class(X1,second)
| ~ dest(X1,paris)
| ~ '$ki_accessible'('#idx(b_s)','$ki_local_world',X1)
| price(X1,seventy) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
tcf(c_0_13,plain,
! [X1: '$ki_world'] : dest(X1,paris),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9])]) ).
tcf(c_0_14,plain,
! [X1: '$ki_world'] : class(X1,second),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_9])]) ).
tcf(c_0_15,negated_conjecture,
~ price(esk1_0,seventy),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
tcf(c_0_16,plain,
! [X1: '$ki_world'] : price(X1,seventy),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13]),c_0_14]),c_0_9])]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NLP267_17 : TPTP v9.3.1. Released v8.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.56 % Computer : n007.cluster.edu
% 0.10/0.56 % Model : x86_64 x86_64
% 0.10/0.56 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.56 % Memory : 8046.5625MB
% 0.10/0.56 % OS : Linux 6.8.0-71-generic
% 0.10/0.56 % CPULimit : 300
% 0.10/0.57 % WCLimit : 300
% 0.10/0.57 % DateTime : Mon Sep 21 01:55:20 UTC 2026
% 0.10/0.57 % CPUTime :
% 0.10/0.57 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.61 Running first-order theorem proving
% 0.10/0.61 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.14/0.63 % Version: 3.5.1
% 0.14/0.63 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.14/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.63 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.14/0.63 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.63 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.63 % Starting sh5l with 300s (1) cores
% 0.14/0.63 % new_bool_3 with pid 4122812 completed with status 0
% 0.14/0.63 % Result found by new_bool_3
% 0.14/0.63 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.14/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.63 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.14/0.63 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.63 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.63 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.63 % Search class: FHHNS-FFSF00-SFFFFFNN
% 0.14/0.63 % partial match(1): FHHNF-FFSF00-SFFFFFNN
% 0.14/0.63 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.63 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.63 % SubtermCWHack with pid 4122817 completed with status 0
% 0.14/0.63 % Result found by SubtermCWHack
% 0.14/0.63 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.14/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.63 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.14/0.63 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.63 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.63 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.63 % Search class: FHHNS-FFSF00-SFFFFFNN
% 0.14/0.63 % partial match(1): FHHNF-FFSF00-SFFFFFNN
% 0.14/0.63 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.63 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.63 % Preprocessing time : 0.001 s
% 0.14/0.63
% 0.14/0.63 % Proof found!
% 0.14/0.63 % SZS status Theorem
% 0.14/0.63 % SZS output start CNFRefutation
% See solution above
% 0.14/0.63 % Parsed axioms : 24
% 0.14/0.63 % Removed by relevancy pruning/SinE : 14
% 0.14/0.63 % Initial clauses : 12
% 0.14/0.63 % Removed in clause preprocessing : 0
% 0.14/0.63 % Initial clauses in saturation : 12
% 0.14/0.63 % Processed clauses : 11
% 0.14/0.63 % ...of these trivial : 0
% 0.14/0.63 % ...subsumed : 2
% 0.14/0.63 % ...remaining for further processing : 9
% 0.14/0.63 % Other redundant clauses eliminated : 0
% 0.14/0.63 % Clauses deleted for lack of memory : 0
% 0.14/0.63 % Backward-subsumed : 0
% 0.14/0.63 % Backward-rewritten : 3
% 0.14/0.63 % Generated clauses : 0
% 0.14/0.63 % ...of the previous two non-redundant : 1
% 0.14/0.63 % ...aggressively subsumed : 0
% 0.14/0.63 % Contextual simplify-reflections : 0
% 0.14/0.63 % Paramodulations : 0
% 0.14/0.63 % Factorizations : 0
% 0.14/0.63 % NegExts : 0
% 0.14/0.63 % Equation resolutions : 0
% 0.14/0.63 % Disequality decompositions : 0
% 0.14/0.63 % Total rewrite steps : 14
% 0.14/0.63 % ...of those cached : 7
% 0.14/0.63 % Propositional unsat checks : 0
% 0.14/0.63 % Propositional check models : 0
% 0.14/0.63 % Propositional check unsatisfiable : 0
% 0.14/0.63 % Propositional clauses : 0
% 0.14/0.63 % Propositional clauses after purity: 0
% 0.14/0.63 % Propositional unsat core size : 0
% 0.14/0.63 % Propositional preprocessing time : 0.000
% 0.14/0.63 % Propositional encoding time : 0.000
% 0.14/0.63 % Propositional solver time : 0.000
% 0.14/0.63 % Success case prop preproc time : 0.000
% 0.14/0.63 % Success case prop encoding time : 0.000
% 0.14/0.63 % Success case prop solver time : 0.000
% 0.14/0.63 % Current number of processed clauses : 6
% 0.14/0.63 % Positive orientable unit clauses : 5
% 0.14/0.63 % Positive unorientable unit clauses: 0
% 0.14/0.63 % Negative unit clauses : 1
% 0.14/0.63 % Non-unit-clauses : 0
% 0.14/0.63 % Current number of unprocessed clauses: 1
% 0.14/0.63 % ...number of literals in the above : 4
% 0.14/0.63 % Current number of archived formulas : 0
% 0.14/0.63 % Current number of archived clauses : 3
% 0.14/0.63 % Clause-clause subsumption calls (NU) : 1
% 0.14/0.63 % Rec. Clause-clause subsumption calls : 1
% 0.14/0.63 % Non-unit clause-clause subsumptions : 1
% 0.14/0.63 % Unit Clause-clause subsumption calls : 0
% 0.14/0.63 % Rewrite failures with RHS unbound : 0
% 0.14/0.63 % BW rewrite match attempts : 3
% 0.14/0.63 % BW rewrite match successes : 3
% 0.14/0.63 % Condensation attempts : 0
% 0.14/0.63 % Condensation successes : 0
% 0.14/0.63 % Termbank termtop insertions : 970
% 0.14/0.63 % Search garbage collected termcells : 147
% 0.14/0.63
% 0.14/0.63 % -------------------------------------------------
% 0.14/0.63 % User time : 0.004 s
% 0.14/0.63 % System time : 0.001 s
% 0.14/0.63 % Total time : 0.005 s
% 0.14/0.63 % Maximum resident set size: 3584 pages
% 0.14/0.63
% 0.14/0.63 % -------------------------------------------------
% 0.14/0.63 % User time : 0.006 s
% 0.14/0.63 % System time : 0.005 s
% 0.14/0.63 % Total time : 0.011 s
% 0.14/0.63 % Maximum resident set size: 4864 pages
% 0.14/0.63 % E exiting
%------------------------------------------------------------------------------