TSTP Solution File: DAT334_23 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : DAT334_23 : TPTP v8.2.0. Released v8.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n031.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sat May 4 07:39:38 EDT 2024
% Result : Theorem 0.22s 0.50s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 17
% Syntax : Number of formulae : 29 ( 9 unt; 13 typ; 0 def)
% Number of atoms : 38 ( 0 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 34 ( 12 ~; 8 |; 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 : 8 ( 4 >; 4 *; 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 : 24 ( 0 sgn 21 !; 3 ?; 15 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_sort1,type,
'$ki_world': $tType ).
tff(decl_22,type,
'$ki_local_world': '$ki_world' ).
tff(decl_23,type,
'$ki_accessible': ( '$ki_world' * '$ki_world' ) > $o ).
tff(decl_24,type,
cs: $i ).
tff(decl_25,type,
sue: $i ).
tff(decl_26,type,
mary: $i ).
tff(decl_27,type,
john: $i ).
tff(decl_28,type,
math: $i ).
tff(decl_29,type,
psych: $i ).
tff(decl_30,type,
teach: ( '$ki_world' * $i * $i ) > $o ).
tff(decl_31,type,
'$ki_exists_in_world_$i': ( '$ki_world' * $i ) > $o ).
tff(decl_33,type,
esk2_1: '$ki_world' > $i ).
tff(decl_34,type,
esk3_0: '$ki_world' ).
tff(verify,conjecture,
! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> ? [X3] :
( '$ki_exists_in_world_$i'(X1,X3)
& teach(X1,X3,cs) ) ),
file('/export/starexec/sandbox2/tmp/tmp.xwnRkMZieQ/E---3.1_5090.p',verify) ).
tff('$ki_exists_in_world_$i_const',axiom,
! [X1: '$ki_world',X3] : '$ki_exists_in_world_$i'(X1,X3),
file('/export/starexec/sandbox2/tmp/tmp.xwnRkMZieQ/E---3.1_5090.p','$ki_exists_in_world_$i_const') ).
tff(db,axiom,
! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> ( teach(X1,john,math)
& ? [X3] :
( '$ki_exists_in_world_$i'(X1,X3)
& teach(X1,X3,cs) )
& teach(X1,mary,psych)
& teach(X1,sue,psych) ) ),
file('/export/starexec/sandbox2/tmp/tmp.xwnRkMZieQ/E---3.1_5090.p',db) ).
tff(mrel_universal,axiom,
! [X1: '$ki_world',X2: '$ki_world'] : '$ki_accessible'(X1,X2),
file('/export/starexec/sandbox2/tmp/tmp.xwnRkMZieQ/E---3.1_5090.p',mrel_universal) ).
tff(c_0_4,negated_conjecture,
~ ! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> ? [X3] :
( '$ki_exists_in_world_$i'(X1,X3)
& teach(X1,X3,cs) ) ),
inference(assume_negation,[status(cth)],[verify]) ).
tff(c_0_5,negated_conjecture,
! [X13] :
( '$ki_accessible'('$ki_local_world',esk3_0)
& ( ~ '$ki_exists_in_world_$i'(esk3_0,X13)
| ~ teach(esk3_0,X13,cs) ) ),
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_4])])])])]) ).
tff(c_0_6,plain,
! [X6: '$ki_world',X7] : '$ki_exists_in_world_$i'(X6,X7),
inference(variable_rename,[status(thm)],['$ki_exists_in_world_$i_const']) ).
tff(c_0_7,plain,
! [X10: '$ki_world'] :
( ( teach(X10,john,math)
| ~ '$ki_accessible'('$ki_local_world',X10) )
& ( '$ki_exists_in_world_$i'(X10,esk2_1(X10))
| ~ '$ki_accessible'('$ki_local_world',X10) )
& ( teach(X10,esk2_1(X10),cs)
| ~ '$ki_accessible'('$ki_local_world',X10) )
& ( teach(X10,mary,psych)
| ~ '$ki_accessible'('$ki_local_world',X10) )
& ( teach(X10,sue,psych)
| ~ '$ki_accessible'('$ki_local_world',X10) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[db])])])])]) ).
tff(c_0_8,plain,
! [X4: '$ki_world',X5: '$ki_world'] : '$ki_accessible'(X4,X5),
inference(variable_rename,[status(thm)],[mrel_universal]) ).
tcf(c_0_9,negated_conjecture,
! [X3] :
( ~ '$ki_exists_in_world_$i'(esk3_0,X3)
| ~ teach(esk3_0,X3,cs) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
tcf(c_0_10,plain,
! [X1: '$ki_world',X3] : '$ki_exists_in_world_$i'(X1,X3),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
tcf(c_0_11,plain,
! [X1: '$ki_world'] :
( teach(X1,esk2_1(X1),cs)
| ~ '$ki_accessible'('$ki_local_world',X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
tcf(c_0_12,plain,
! [X1: '$ki_world',X2: '$ki_world'] : '$ki_accessible'(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
tcf(c_0_13,negated_conjecture,
! [X3] : ~ teach(esk3_0,X3,cs),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10])]) ).
tcf(c_0_14,plain,
! [X1: '$ki_world'] : teach(X1,esk2_1(X1),cs),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12])]) ).
cnf(c_0_15,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_13,c_0_14]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : DAT334_23 : TPTP v8.2.0. Released v8.2.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n031.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri May 3 09:17:32 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.22/0.49 Running first-order model finding
% 0.22/0.49 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.xwnRkMZieQ/E---3.1_5090.p
% 0.22/0.50 # Version: 3.1.0
% 0.22/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.50 # Starting sh5l with 300s (1) cores
% 0.22/0.50 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 5203 completed with status 0
% 0.22/0.50 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.22/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.50 # No SInE strategy applied
% 0.22/0.50 # Search class: FUUNM-FFSF11-SFFFFFNN
% 0.22/0.50 # partial match(1): FUUNF-FFSF11-SFFFFFNN
% 0.22/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.22/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.22/0.50 # Starting new_bool_3 with 136s (1) cores
% 0.22/0.50 # Starting new_bool_1 with 136s (1) cores
% 0.22/0.50 # Starting sh5l with 136s (1) cores
% 0.22/0.50 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 5211 completed with status 0
% 0.22/0.50 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.22/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.50 # No SInE strategy applied
% 0.22/0.50 # Search class: FUUNM-FFSF11-SFFFFFNN
% 0.22/0.50 # partial match(1): FUUNF-FFSF11-SFFFFFNN
% 0.22/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.22/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.22/0.50 # Preprocessing time : 0.001 s
% 0.22/0.50 # Presaturation interreduction done
% 0.22/0.50
% 0.22/0.50 # Proof found!
% 0.22/0.50 # SZS status Theorem
% 0.22/0.50 # SZS output start CNFRefutation
% See solution above
% 0.22/0.50 # Parsed axioms : 16
% 0.22/0.50 # Removed by relevancy pruning/SinE : 0
% 0.22/0.50 # Initial clauses : 21
% 0.22/0.50 # Removed in clause preprocessing : 16
% 0.22/0.50 # Initial clauses in saturation : 5
% 0.22/0.50 # Processed clauses : 10
% 0.22/0.50 # ...of these trivial : 0
% 0.22/0.50 # ...subsumed : 0
% 0.22/0.50 # ...remaining for further processing : 10
% 0.22/0.50 # Other redundant clauses eliminated : 0
% 0.22/0.50 # Clauses deleted for lack of memory : 0
% 0.22/0.50 # Backward-subsumed : 0
% 0.22/0.50 # Backward-rewritten : 0
% 0.22/0.50 # Generated clauses : 1
% 0.22/0.50 # ...of the previous two non-redundant : 0
% 0.22/0.50 # ...aggressively subsumed : 0
% 0.22/0.50 # Contextual simplify-reflections : 0
% 0.22/0.50 # Paramodulations : 1
% 0.22/0.50 # Factorizations : 0
% 0.22/0.50 # NegExts : 0
% 0.22/0.50 # Equation resolutions : 0
% 0.22/0.50 # Disequality decompositions : 0
% 0.22/0.50 # Total rewrite steps : 0
% 0.22/0.50 # ...of those cached : 0
% 0.22/0.50 # Propositional unsat checks : 0
% 0.22/0.50 # Propositional check models : 0
% 0.22/0.50 # Propositional check unsatisfiable : 0
% 0.22/0.50 # Propositional clauses : 0
% 0.22/0.50 # Propositional clauses after purity: 0
% 0.22/0.50 # Propositional unsat core size : 0
% 0.22/0.50 # Propositional preprocessing time : 0.000
% 0.22/0.50 # Propositional encoding time : 0.000
% 0.22/0.50 # Propositional solver time : 0.000
% 0.22/0.50 # Success case prop preproc time : 0.000
% 0.22/0.50 # Success case prop encoding time : 0.000
% 0.22/0.50 # Success case prop solver time : 0.000
% 0.22/0.50 # Current number of processed clauses : 5
% 0.22/0.50 # Positive orientable unit clauses : 4
% 0.22/0.50 # Positive unorientable unit clauses: 0
% 0.22/0.50 # Negative unit clauses : 1
% 0.22/0.50 # Non-unit-clauses : 0
% 0.22/0.50 # Current number of unprocessed clauses: 0
% 0.22/0.50 # ...number of literals in the above : 0
% 0.22/0.50 # Current number of archived formulas : 0
% 0.22/0.50 # Current number of archived clauses : 7
% 0.22/0.50 # Clause-clause subsumption calls (NU) : 0
% 0.22/0.50 # Rec. Clause-clause subsumption calls : 0
% 0.22/0.50 # Non-unit clause-clause subsumptions : 0
% 0.22/0.50 # Unit Clause-clause subsumption calls : 0
% 0.22/0.50 # Rewrite failures with RHS unbound : 0
% 0.22/0.50 # BW rewrite match attempts : 0
% 0.22/0.50 # BW rewrite match successes : 0
% 0.22/0.50 # Condensation attempts : 0
% 0.22/0.50 # Condensation successes : 0
% 0.22/0.50 # Termbank termtop insertions : 506
% 0.22/0.50 # Search garbage collected termcells : 76
% 0.22/0.50
% 0.22/0.50 # -------------------------------------------------
% 0.22/0.50 # User time : 0.003 s
% 0.22/0.50 # System time : 0.002 s
% 0.22/0.50 # Total time : 0.006 s
% 0.22/0.50 # Maximum resident set size: 1780 pages
% 0.22/0.50
% 0.22/0.50 # -------------------------------------------------
% 0.22/0.50 # User time : 0.008 s
% 0.22/0.50 # System time : 0.010 s
% 0.22/0.50 # Total time : 0.018 s
% 0.22/0.50 # Maximum resident set size: 1712 pages
% 0.22/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------