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