%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : DAT334_21 : TPTP v9.3.1. Released v8.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n005.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 12:21:13 PM UTC 2026
% Result : Theorem 0.11s 0.45s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 2
% Syntax : Number of formulae : 11 ( 3 unt; 0 typ; 0 def)
% Number of atoms : 34 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 36 ( 13 ~; 9 |; 11 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 8 con; 0-1 aty)
% Number of variables : 11 ( 0 sgn 8 !; 3 ?; 6 :)
% 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,
cs: $i ).
tff(decl_26,type,
sue: $i ).
tff(decl_27,type,
mary: $i ).
tff(decl_28,type,
john: $i ).
tff(decl_29,type,
math: $i ).
tff(decl_30,type,
psych: $i ).
tff(decl_31,type,
teach: ( $i * ( $i * '$ki_world' ) ) > $o ).
tff(decl_32,type,
'$ki_exists_in_world_$i': ( $i * '$ki_world' ) > $o ).
tff(decl_35,type,
esk3_1: '$ki_world' > $i ).
tff(decl_36,type,
esk4_0: '$ki_world' ).
tff(verify,conjecture,
! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> ? [X3] :
( teach(X1,X3,cs)
& '$ki_exists_in_world_$i'(X1,X3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',verify) ).
tff(db,axiom,
! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> ( teach(X1,sue,psych)
& teach(X1,mary,psych)
& ? [X3] :
( teach(X1,X3,cs)
& '$ki_exists_in_world_$i'(X1,X3) )
& teach(X1,john,math) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',db) ).
tff(c_0_2,negated_conjecture,
~ ! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> ? [X3] :
( teach(X1,X3,cs)
& '$ki_exists_in_world_$i'(X1,X3) ) ),
inference(assume_negation,[status(cth)],[verify]) ).
tff(c_0_3,negated_conjecture,
! [X14] :
( ( ~ teach(esk4_0,X14,cs)
| ~ '$ki_exists_in_world_$i'(esk4_0,X14) )
& '$ki_accessible'('$ki_local_world',esk4_0) ),
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_2])])])])]) ).
tff(c_0_4,plain,
! [X11: '$ki_world'] :
( ( ~ '$ki_accessible'('$ki_local_world',X11)
| teach(X11,sue,psych) )
& ( ~ '$ki_accessible'('$ki_local_world',X11)
| teach(X11,mary,psych) )
& ( ~ '$ki_accessible'('$ki_local_world',X11)
| teach(X11,esk3_1(X11),cs) )
& ( ~ '$ki_accessible'('$ki_local_world',X11)
| '$ki_exists_in_world_$i'(X11,esk3_1(X11)) )
& ( ~ '$ki_accessible'('$ki_local_world',X11)
| teach(X11,john,math) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[db])])])])]) ).
tcf(c_0_5,negated_conjecture,
! [X3] :
( ~ teach(esk4_0,X3,cs)
| ~ '$ki_exists_in_world_$i'(esk4_0,X3) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
tcf(c_0_6,plain,
! [X1: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X1)
| teach(X1,esk3_1(X1),cs) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
tcf(c_0_7,negated_conjecture,
'$ki_accessible'('$ki_local_world',esk4_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
tcf(c_0_8,negated_conjecture,
~ '$ki_exists_in_world_$i'(esk4_0,esk3_1(esk4_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7])]) ).
tcf(c_0_9,plain,
! [X1: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X1)
| '$ki_exists_in_world_$i'(X1,esk3_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_10,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_7])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : DAT334_21 : TPTP v9.3.1. Released v8.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.38 % Computer : n005.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Mon Sep 21 15:34:02 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.39 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.43 Running first-order theorem proving
% 0.11/0.43 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.11/0.45 % Version: 3.5.1
% 0.11/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.45 % Starting sh5l with 300s (1) cores
% 0.11/0.45 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3836683 completed with status 0
% 0.11/0.45 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.11/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.45 % No SInE strategy applied
% 0.11/0.45 % Search class: FHHNS-FFSF11-SFFFFFNN
% 0.11/0.45 % partial match(1): FHHNF-FFSF11-SFFFFFNN
% 0.11/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.11/0.45 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.11/0.45 % Starting new_bool_3 with 136s (1) cores
% 0.11/0.45 % Starting new_bool_1 with 136s (1) cores
% 0.11/0.45 % SubtermCWHack with pid 3836688 completed with status 0
% 0.11/0.45 % Result found by SubtermCWHack
% 0.11/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.45 % No SInE strategy applied
% 0.11/0.45 % Search class: FHHNS-FFSF11-SFFFFFNN
% 0.11/0.45 % partial match(1): FHHNF-FFSF11-SFFFFFNN
% 0.11/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.45 % Preprocessing time : 0.001 s
% 0.11/0.45
% 0.11/0.45 % Proof found!
% 0.11/0.45 % SZS status Theorem
% 0.11/0.45 % SZS output start CNFRefutation
% See solution above
% 0.11/0.45 % Parsed axioms : 16
% 0.11/0.45 % Removed by relevancy pruning/SinE : 0
% 0.11/0.45 % Initial clauses : 21
% 0.11/0.45 % Removed in clause preprocessing : 11
% 0.11/0.45 % Initial clauses in saturation : 10
% 0.11/0.45 % Processed clauses : 10
% 0.11/0.45 % ...of these trivial : 0
% 0.11/0.45 % ...subsumed : 0
% 0.11/0.45 % ...remaining for further processing : 10
% 0.11/0.45 % Other redundant clauses eliminated : 0
% 0.11/0.45 % Clauses deleted for lack of memory : 0
% 0.11/0.45 % Backward-subsumed : 0
% 0.11/0.45 % Backward-rewritten : 0
% 0.11/0.45 % Generated clauses : 2
% 0.11/0.45 % ...of the previous two non-redundant : 1
% 0.11/0.45 % ...aggressively subsumed : 0
% 0.11/0.45 % Contextual simplify-reflections : 0
% 0.11/0.45 % Paramodulations : 2
% 0.11/0.45 % Factorizations : 0
% 0.11/0.45 % NegExts : 0
% 0.11/0.45 % Equation resolutions : 0
% 0.11/0.45 % Disequality decompositions : 0
% 0.11/0.45 % Total rewrite steps : 2
% 0.11/0.45 % ...of those cached : 1
% 0.11/0.45 % Propositional unsat checks : 0
% 0.11/0.45 % Propositional check models : 0
% 0.11/0.45 % Propositional check unsatisfiable : 0
% 0.11/0.45 % Propositional clauses : 0
% 0.11/0.45 % Propositional clauses after purity: 0
% 0.11/0.45 % Propositional unsat core size : 0
% 0.11/0.45 % Propositional preprocessing time : 0.000
% 0.11/0.45 % Propositional encoding time : 0.000
% 0.11/0.45 % Propositional solver time : 0.000
% 0.11/0.45 % Success case prop preproc time : 0.000
% 0.11/0.45 % Success case prop encoding time : 0.000
% 0.11/0.45 % Success case prop solver time : 0.000
% 0.11/0.45 % Current number of processed clauses : 10
% 0.11/0.45 % Positive orientable unit clauses : 3
% 0.11/0.45 % Positive unorientable unit clauses: 0
% 0.11/0.45 % Negative unit clauses : 1
% 0.11/0.45 % Non-unit-clauses : 6
% 0.11/0.45 % Current number of unprocessed clauses: 1
% 0.11/0.45 % ...number of literals in the above : 3
% 0.11/0.45 % Current number of archived formulas : 0
% 0.11/0.45 % Current number of archived clauses : 0
% 0.11/0.45 % Clause-clause subsumption calls (NU) : 4
% 0.11/0.45 % Rec. Clause-clause subsumption calls : 4
% 0.11/0.45 % Non-unit clause-clause subsumptions : 0
% 0.11/0.45 % Unit Clause-clause subsumption calls : 1
% 0.11/0.45 % Rewrite failures with RHS unbound : 0
% 0.11/0.45 % BW rewrite match attempts : 0
% 0.11/0.45 % BW rewrite match successes : 0
% 0.11/0.45 % Condensation attempts : 0
% 0.11/0.45 % Condensation successes : 0
% 0.11/0.45 % Termbank termtop insertions : 667
% 0.11/0.45 % Search garbage collected termcells : 101
% 0.11/0.45
% 0.11/0.45 % -------------------------------------------------
% 0.11/0.45 % User time : 0.003 s
% 0.11/0.45 % System time : 0.004 s
% 0.11/0.45 % Total time : 0.007 s
% 0.11/0.45 % Maximum resident set size: 3636 pages
% 0.11/0.45
% 0.11/0.45 % -------------------------------------------------
% 0.11/0.45 % User time : 0.010 s
% 0.11/0.45 % System time : 0.011 s
% 0.11/0.45 % Total time : 0.021 s
% 0.11/0.45 % Maximum resident set size: 4864 pages
% 0.11/0.45 % E exiting
%------------------------------------------------------------------------------