%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : DAT333_3 : 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 : n014.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:12 PM UTC 2026
% Result : Theorem 0.14s 5.43s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 14 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 38 ( 0 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 38 ( 14 ~; 10 |; 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; 7 con; 0-1 aty)
% Number of variables : 19 ( 0 sgn 16 !; 3 ?; 8 :)
% 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_1: $i > '$ki_world' ).
tff(verify,conjecture,
? [X3] :
( ! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> teach(X1,john,X3) )
& '$ki_exists_in_world_$i'('$ki_local_world',X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',verify) ).
tff('$ki_exists_in_world_$i_const',axiom,
! [X1: '$ki_world',X3] : '$ki_exists_in_world_$i'(X1,X3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','$ki_exists_in_world_$i_const') ).
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_3,negated_conjecture,
~ ? [X3] :
( ! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> teach(X1,john,X3) )
& '$ki_exists_in_world_$i'('$ki_local_world',X3) ),
inference(assume_negation,[status(cth)],[verify]) ).
tff(c_0_4,negated_conjecture,
! [X12] :
( ( ~ '$ki_exists_in_world_$i'('$ki_local_world',X12)
| ~ teach(esk4_1(X12),john,X12) )
& ( ~ '$ki_exists_in_world_$i'('$ki_local_world',X12)
| '$ki_accessible'('$ki_local_world',esk4_1(X12)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])])]) ).
tff(c_0_5,plain,
! [X6: '$ki_world',X7] : '$ki_exists_in_world_$i'(X6,X7),
inference(variable_rename,[status(thm)],['$ki_exists_in_world_$i_const']) ).
tcf(c_0_6,negated_conjecture,
! [X3] :
( ~ '$ki_exists_in_world_$i'('$ki_local_world',X3)
| ~ teach(esk4_1(X3),john,X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
tcf(c_0_7,plain,
! [X1: '$ki_world',X3] : '$ki_exists_in_world_$i'(X1,X3),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
tff(c_0_8,plain,
! [X10: '$ki_world'] :
( ( ~ '$ki_accessible'('$ki_local_world',X10)
| teach(X10,sue,psych) )
& ( ~ '$ki_accessible'('$ki_local_world',X10)
| teach(X10,mary,psych) )
& ( ~ '$ki_accessible'('$ki_local_world',X10)
| teach(X10,esk3_1(X10),cs) )
& ( ~ '$ki_accessible'('$ki_local_world',X10)
| '$ki_exists_in_world_$i'(X10,esk3_1(X10)) )
& ( ~ '$ki_accessible'('$ki_local_world',X10)
| teach(X10,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_9,negated_conjecture,
! [X3] :
( ~ '$ki_exists_in_world_$i'('$ki_local_world',X3)
| '$ki_accessible'('$ki_local_world',esk4_1(X3)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
tcf(c_0_10,negated_conjecture,
! [X3] : ~ teach(esk4_1(X3),john,X3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7])]) ).
tcf(c_0_11,plain,
! [X1: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X1)
| teach(X1,john,math) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
tcf(c_0_12,negated_conjecture,
! [X3] : '$ki_accessible'('$ki_local_world',esk4_1(X3)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_7])]) ).
cnf(c_0_13,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : DAT333_3 : TPTP v9.3.1. Released v8.2.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/5.37 % Computer : n014.cluster.edu
% 0.09/5.37 % Model : x86_64 x86_64
% 0.09/5.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.37 % Memory : 8046.5625MB
% 0.09/5.37 % OS : Linux 6.8.0-71-generic
% 0.09/5.37 % CPULimit : 300
% 0.09/5.37 % WCLimit : 300
% 0.09/5.37 % DateTime : Mon Sep 21 15:33:55 UTC 2026
% 0.09/5.37 % CPUTime :
% 0.09/5.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/5.41 Running first-order theorem proving
% 0.14/5.41 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.14/5.43 % Version: 3.5.1
% 0.14/5.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/5.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/5.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/5.43 % Starting new_bool_3 with 300s (1) cores
% 0.14/5.43 % Starting new_bool_1 with 300s (1) cores
% 0.14/5.43 % Starting sh5l with 300s (1) cores
% 0.14/5.43 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 211714 completed with status 0
% 0.14/5.43 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.14/5.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/5.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/5.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/5.43 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/5.43 % No SInE strategy applied
% 0.14/5.43 % Search class: FHUNS-FFSF11-SFFFFFNN
% 0.14/5.43 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/5.43 % Starting SubtermCWHack with 136s (1) cores
% 0.14/5.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/5.43 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.14/5.43 % Starting new_bool_3 with 136s (1) cores
% 0.14/5.43 % Starting new_bool_1 with 136s (1) cores
% 0.14/5.43 % SubtermCWHack with pid 211718 completed with status 0
% 0.14/5.43 % Result found by SubtermCWHack
% 0.14/5.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/5.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/5.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/5.43 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/5.43 % No SInE strategy applied
% 0.14/5.43 % Search class: FHUNS-FFSF11-SFFFFFNN
% 0.14/5.43 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/5.43 % Starting SubtermCWHack with 136s (1) cores
% 0.14/5.43 % Preprocessing time : 0.001 s
% 0.14/5.43
% 0.14/5.43 % Proof found!
% 0.14/5.43 % SZS status Theorem
% 0.14/5.43 % SZS output start CNFRefutation
% See solution above
% 0.14/5.43 % Parsed axioms : 16
% 0.14/5.43 % Removed by relevancy pruning/SinE : 0
% 0.14/5.43 % Initial clauses : 21
% 0.14/5.43 % Removed in clause preprocessing : 14
% 0.14/5.43 % Initial clauses in saturation : 7
% 0.14/5.43 % Processed clauses : 6
% 0.14/5.43 % ...of these trivial : 0
% 0.14/5.43 % ...subsumed : 0
% 0.14/5.43 % ...remaining for further processing : 6
% 0.14/5.43 % Other redundant clauses eliminated : 0
% 0.14/5.43 % Clauses deleted for lack of memory : 0
% 0.14/5.43 % Backward-subsumed : 0
% 0.14/5.43 % Backward-rewritten : 0
% 0.14/5.43 % Generated clauses : 1
% 0.14/5.43 % ...of the previous two non-redundant : 0
% 0.14/5.43 % ...aggressively subsumed : 0
% 0.14/5.43 % Contextual simplify-reflections : 0
% 0.14/5.43 % Paramodulations : 1
% 0.14/5.43 % Factorizations : 0
% 0.14/5.43 % NegExts : 0
% 0.14/5.43 % Equation resolutions : 0
% 0.14/5.43 % Disequality decompositions : 0
% 0.14/5.43 % Total rewrite steps : 1
% 0.14/5.43 % ...of those cached : 0
% 0.14/5.43 % Propositional unsat checks : 0
% 0.14/5.43 % Propositional check models : 0
% 0.14/5.43 % Propositional check unsatisfiable : 0
% 0.14/5.43 % Propositional clauses : 0
% 0.14/5.43 % Propositional clauses after purity: 0
% 0.14/5.43 % Propositional unsat core size : 0
% 0.14/5.43 % Propositional preprocessing time : 0.000
% 0.14/5.43 % Propositional encoding time : 0.000
% 0.14/5.43 % Propositional solver time : 0.000
% 0.14/5.43 % Success case prop preproc time : 0.000
% 0.14/5.43 % Success case prop encoding time : 0.000
% 0.14/5.43 % Success case prop solver time : 0.000
% 0.14/5.43 % Current number of processed clauses : 6
% 0.14/5.43 % Positive orientable unit clauses : 2
% 0.14/5.43 % Positive unorientable unit clauses: 0
% 0.14/5.43 % Negative unit clauses : 1
% 0.14/5.43 % Non-unit-clauses : 3
% 0.14/5.43 % Current number of unprocessed clauses: 1
% 0.14/5.43 % ...number of literals in the above : 2
% 0.14/5.43 % Current number of archived formulas : 0
% 0.14/5.43 % Current number of archived clauses : 1
% 0.14/5.43 % Clause-clause subsumption calls (NU) : 0
% 0.14/5.43 % Rec. Clause-clause subsumption calls : 0
% 0.14/5.43 % Non-unit clause-clause subsumptions : 0
% 0.14/5.43 % Unit Clause-clause subsumption calls : 0
% 0.14/5.43 % Rewrite failures with RHS unbound : 0
% 0.14/5.43 % BW rewrite match attempts : 0
% 0.14/5.43 % BW rewrite match successes : 0
% 0.14/5.43 % Condensation attempts : 0
% 0.14/5.43 % Condensation successes : 0
% 0.14/5.43 % Termbank termtop insertions : 570
% 0.14/5.43 % Search garbage collected termcells : 79
% 0.14/5.43
% 0.14/5.43 % -------------------------------------------------
% 0.14/5.43 % User time : 0.003 s
% 0.14/5.43 % System time : 0.002 s
% 0.14/5.43 % Total time : 0.005 s
% 0.14/5.43 % Maximum resident set size: 3636 pages
% 0.14/5.43
% 0.14/5.43 % -------------------------------------------------
% 0.14/5.43 % User time : 0.008 s
% 0.14/5.43 % System time : 0.012 s
% 0.14/5.43 % Total time : 0.020 s
% 0.14/5.43 % Maximum resident set size: 4608 pages
% 0.14/5.43 % E exiting
%------------------------------------------------------------------------------