%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : PUZ149_13 : 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 : n018.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 02:02:00 PM UTC 2026
% Result : Theorem 0.09s 0.43s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 25 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 78 ( 0 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 95 ( 42 ~; 27 |; 16 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 7 con; 0-0 aty)
% Number of variables : 35 ( 0 sgn 25 !; 10 ?; 35 :)
% 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(make_c)': '$ki_index' ).
tff(decl_26,type,
'#idx(pour_b)': '$ki_index' ).
tff(decl_27,type,
'#idx(pour_a)': '$ki_index' ).
tff(decl_28,type,
acid: '$ki_world' > $o ).
tff(decl_31,type,
esk3_0: '$ki_world' ).
tff(decl_32,type,
esk4_0: '$ki_world' ).
tff(decl_37,type,
esk9_0: '$ki_world' ).
tff(verify,conjecture,
( ? [X1: '$ki_world'] :
( ? [X2: '$ki_world'] :
( acid(X2)
& '$ki_accessible'('#idx(pour_b)',X1,X2) )
& '$ki_accessible'('#idx(pour_a)','$ki_local_world',X1) )
& ? [X1: '$ki_world'] :
( ~ acid(X1)
& '$ki_accessible'('#idx(pour_a)','$ki_local_world',X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',verify) ).
tff(pour_a_acid,axiom,
! [X1: '$ki_world'] :
( '$ki_accessible'('#idx(pour_a)','$ki_local_world',X1)
=> ~ acid(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pour_a_acid) ).
tff(pour_ab_make_axiom_2,axiom,
( ! [X1: '$ki_world'] :
( '$ki_accessible'('#idx(pour_a)','$ki_local_world',X1)
=> ! [X2: '$ki_world'] :
( '$ki_accessible'('#idx(pour_b)',X1,X2)
=> ~ acid(X2) ) )
=> ! [X1: '$ki_world'] :
( '$ki_accessible'('#idx(make_c)','$ki_local_world',X1)
=> ~ acid(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pour_ab_make_axiom_2) ).
tff(make_c_acid,axiom,
? [X1: '$ki_world'] :
( acid(X1)
& '$ki_accessible'('#idx(make_c)','$ki_local_world',X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',make_c_acid) ).
tff(c_0_4,negated_conjecture,
~ ( ? [X1: '$ki_world'] :
( ? [X2: '$ki_world'] :
( acid(X2)
& '$ki_accessible'('#idx(pour_b)',X1,X2) )
& '$ki_accessible'('#idx(pour_a)','$ki_local_world',X1) )
& ? [X1: '$ki_world'] :
( ~ acid(X1)
& '$ki_accessible'('#idx(pour_a)','$ki_local_world',X1) ) ),
inference(assume_negation,[status(cth)],[verify]) ).
tff(c_0_5,negated_conjecture,
~ ( ? [X1: '$ki_world'] :
( ? [X2: '$ki_world'] :
( acid(X2)
& '$ki_accessible'('#idx(pour_b)',X1,X2) )
& '$ki_accessible'('#idx(pour_a)','$ki_local_world',X1) )
& ? [X1: '$ki_world'] :
( ~ acid(X1)
& '$ki_accessible'('#idx(pour_a)','$ki_local_world',X1) ) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
tff(c_0_6,plain,
! [X1: '$ki_world'] :
( '$ki_accessible'('#idx(pour_a)','$ki_local_world',X1)
=> ~ acid(X1) ),
inference(fof_simplification,[status(thm)],[pour_a_acid]) ).
tff(c_0_7,plain,
( ! [X1: '$ki_world'] :
( '$ki_accessible'('#idx(pour_a)','$ki_local_world',X1)
=> ! [X2: '$ki_world'] :
( '$ki_accessible'('#idx(pour_b)',X1,X2)
=> ~ acid(X2) ) )
=> ! [X1: '$ki_world'] :
( '$ki_accessible'('#idx(make_c)','$ki_local_world',X1)
=> ~ acid(X1) ) ),
inference(fof_simplification,[status(thm)],[pour_ab_make_axiom_2]) ).
tff(c_0_8,negated_conjecture,
! [X3: '$ki_world',X4: '$ki_world',X5: '$ki_world'] :
( ~ acid(X5)
| ~ '$ki_accessible'('#idx(pour_b)',X4,X5)
| ~ '$ki_accessible'('#idx(pour_a)','$ki_local_world',X4)
| acid(X3)
| ~ '$ki_accessible'('#idx(pour_a)','$ki_local_world',X3) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
tff(c_0_9,plain,
! [X18: '$ki_world'] :
( ~ acid(X18)
| ~ '$ki_accessible'('#idx(pour_a)','$ki_local_world',X18) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
tff(c_0_10,plain,
! [X11: '$ki_world'] :
( ( ~ acid(X11)
| ~ '$ki_accessible'('#idx(make_c)','$ki_local_world',X11)
| acid(esk4_0) )
& ( ~ acid(X11)
| ~ '$ki_accessible'('#idx(make_c)','$ki_local_world',X11)
| '$ki_accessible'('#idx(pour_b)',esk3_0,esk4_0) )
& ( ~ acid(X11)
| ~ '$ki_accessible'('#idx(make_c)','$ki_local_world',X11)
| '$ki_accessible'('#idx(pour_a)','$ki_local_world',esk3_0) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])])])]) ).
tff(c_0_11,plain,
( acid(esk9_0)
& '$ki_accessible'('#idx(make_c)','$ki_local_world',esk9_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[make_c_acid])]) ).
tcf(c_0_12,negated_conjecture,
! [X1: '$ki_world',X2: '$ki_world',X3: '$ki_world'] :
( ~ acid(X3)
| ~ '$ki_accessible'('#idx(pour_b)',X2,X3)
| ~ '$ki_accessible'('#idx(pour_a)','$ki_local_world',X2)
| ~ '$ki_accessible'('#idx(pour_a)','$ki_local_world',X1)
| acid(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
tcf(c_0_13,plain,
! [X1: '$ki_world'] :
( ~ acid(X1)
| ~ '$ki_accessible'('#idx(pour_a)','$ki_local_world',X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
tcf(c_0_14,plain,
! [X1: '$ki_world'] :
( ~ acid(X1)
| ~ '$ki_accessible'('#idx(make_c)','$ki_local_world',X1)
| '$ki_accessible'('#idx(pour_a)','$ki_local_world',esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
tcf(c_0_15,plain,
'$ki_accessible'('#idx(make_c)','$ki_local_world',esk9_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
tcf(c_0_16,plain,
acid(esk9_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
tcf(c_0_17,negated_conjecture,
! [X3: '$ki_world',X2: '$ki_world',X1: '$ki_world'] :
( ~ '$ki_accessible'('#idx(pour_b)',X2,X1)
| ~ '$ki_accessible'('#idx(pour_a)','$ki_local_world',X3)
| ~ '$ki_accessible'('#idx(pour_a)','$ki_local_world',X2)
| ~ acid(X1) ),
inference(csr,[status(thm)],[c_0_12,c_0_13]) ).
tcf(c_0_18,plain,
'$ki_accessible'('#idx(pour_a)','$ki_local_world',esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]) ).
tcf(c_0_19,plain,
! [X1: '$ki_world'] :
( ~ acid(X1)
| ~ '$ki_accessible'('#idx(make_c)','$ki_local_world',X1)
| '$ki_accessible'('#idx(pour_b)',esk3_0,esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
tcf(c_0_20,plain,
! [X1: '$ki_world'] :
( ~ acid(X1)
| ~ '$ki_accessible'('#idx(make_c)','$ki_local_world',X1)
| acid(esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
tcf(c_0_21,negated_conjecture,
! [X2: '$ki_world',X1: '$ki_world'] :
( ~ '$ki_accessible'('#idx(pour_b)',X2,X1)
| ~ '$ki_accessible'('#idx(pour_a)','$ki_local_world',X2)
| ~ acid(X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
tcf(c_0_22,plain,
'$ki_accessible'('#idx(pour_b)',esk3_0,esk4_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_15]),c_0_16])]) ).
tcf(c_0_23,plain,
acid(esk4_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_15]),c_0_16])]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PUZ149_13 : TPTP v9.3.1. Released v8.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n018.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 03:55:58 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.41 Running first-order theorem proving
% 0.09/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.09/0.43 % Version: 3.5.1
% 0.09/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.09/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.09/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.09/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.09/0.43 % Starting sh5l with 300s (1) cores
% 0.09/0.43 % new_bool_3 with pid 912896 completed with status 0
% 0.09/0.43 % Result found by new_bool_3
% 0.09/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.09/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.09/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.09/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.09/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.09/0.43 % Search class: FGHNF-FFSF00-SFFFFFNN
% 0.09/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.09/0.43 % SubtermCWHack with pid 912899 completed with status 0
% 0.09/0.43 % Result found by SubtermCWHack
% 0.09/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.09/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.09/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.09/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.09/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.09/0.43 % Search class: FGHNF-FFSF00-SFFFFFNN
% 0.09/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.09/0.43 % Preprocessing time : 0.001 s
% 0.09/0.43
% 0.09/0.43 % Proof found!
% 0.09/0.43 % SZS status Theorem
% 0.09/0.43 % SZS output start CNFRefutation
% See solution above
% 0.09/0.43 % Parsed axioms : 15
% 0.09/0.43 % Removed by relevancy pruning/SinE : 8
% 0.09/0.43 % Initial clauses : 16
% 0.09/0.43 % Removed in clause preprocessing : 0
% 0.09/0.43 % Initial clauses in saturation : 16
% 0.09/0.43 % Processed clauses : 24
% 0.09/0.43 % ...of these trivial : 0
% 0.09/0.43 % ...subsumed : 0
% 0.09/0.43 % ...remaining for further processing : 24
% 0.09/0.43 % Other redundant clauses eliminated : 0
% 0.09/0.43 % Clauses deleted for lack of memory : 0
% 0.09/0.43 % Backward-subsumed : 1
% 0.09/0.43 % Backward-rewritten : 6
% 0.09/0.43 % Generated clauses : 16
% 0.09/0.43 % ...of the previous two non-redundant : 8
% 0.09/0.43 % ...aggressively subsumed : 0
% 0.09/0.43 % Contextual simplify-reflections : 1
% 0.09/0.43 % Paramodulations : 16
% 0.09/0.43 % Factorizations : 0
% 0.09/0.43 % NegExts : 0
% 0.09/0.43 % Equation resolutions : 0
% 0.09/0.43 % Disequality decompositions : 0
% 0.09/0.43 % Total rewrite steps : 20
% 0.09/0.43 % ...of those cached : 13
% 0.09/0.43 % Propositional unsat checks : 0
% 0.09/0.43 % Propositional check models : 0
% 0.09/0.43 % Propositional check unsatisfiable : 0
% 0.09/0.43 % Propositional clauses : 0
% 0.09/0.43 % Propositional clauses after purity: 0
% 0.09/0.43 % Propositional unsat core size : 0
% 0.09/0.43 % Propositional preprocessing time : 0.000
% 0.09/0.43 % Propositional encoding time : 0.000
% 0.09/0.43 % Propositional solver time : 0.000
% 0.09/0.43 % Success case prop preproc time : 0.000
% 0.09/0.43 % Success case prop encoding time : 0.000
% 0.09/0.43 % Success case prop solver time : 0.000
% 0.09/0.43 % Current number of processed clauses : 17
% 0.09/0.43 % Positive orientable unit clauses : 8
% 0.09/0.43 % Positive unorientable unit clauses: 0
% 0.09/0.43 % Negative unit clauses : 1
% 0.09/0.43 % Non-unit-clauses : 8
% 0.09/0.43 % Current number of unprocessed clauses: 0
% 0.09/0.43 % ...number of literals in the above : 0
% 0.09/0.43 % Current number of archived formulas : 0
% 0.09/0.43 % Current number of archived clauses : 7
% 0.09/0.43 % Clause-clause subsumption calls (NU) : 22
% 0.09/0.43 % Rec. Clause-clause subsumption calls : 21
% 0.09/0.43 % Non-unit clause-clause subsumptions : 2
% 0.09/0.43 % Unit Clause-clause subsumption calls : 9
% 0.09/0.43 % Rewrite failures with RHS unbound : 0
% 0.09/0.43 % BW rewrite match attempts : 9
% 0.09/0.43 % BW rewrite match successes : 6
% 0.09/0.43 % Condensation attempts : 0
% 0.09/0.43 % Condensation successes : 0
% 0.09/0.43 % Termbank termtop insertions : 1611
% 0.09/0.43 % Search garbage collected termcells : 293
% 0.09/0.43
% 0.09/0.43 % -------------------------------------------------
% 0.09/0.43 % User time : 0.004 s
% 0.09/0.43 % System time : 0.003 s
% 0.09/0.43 % Total time : 0.007 s
% 0.09/0.43 % Maximum resident set size: 3636 pages
% 0.09/0.43
% 0.09/0.43 % -------------------------------------------------
% 0.09/0.43 % User time : 0.005 s
% 0.09/0.43 % System time : 0.008 s
% 0.09/0.43 % Total time : 0.013 s
% 0.09/0.43 % Maximum resident set size: 4608 pages
% 0.09/0.43 % E exiting
%------------------------------------------------------------------------------