TSTP Solution File: SYO887_22 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SYO887_22 : TPTP v8.2.0. Released v8.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n008.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 : Tue May 21 08:55:13 EDT 2024
% Result : Theorem 0.20s 0.49s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of formulae : 17 ( 4 unt; 6 typ; 0 def)
% Number of atoms : 32 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 34 ( 13 ~; 9 |; 8 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 7 ( 4 >; 3 *; 0 +; 0 <<)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 19 ( 0 sgn 13 !; 6 ?; 13 :)
% 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,
f: ( '$ki_world' * $i ) > $o ).
tff(decl_25,type,
'$ki_exists_in_world_$i': ( '$ki_world' * $i ) > $o ).
tff(decl_26,type,
esk1_1: '$ki_world' > $i ).
tff(verify,conjecture,
( ! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> ? [X4] :
( '$ki_exists_in_world_$i'(X1,X4)
& f(X1,X4) ) )
=> ? [X4] :
( '$ki_exists_in_world_$i'('$ki_local_world',X4)
& ? [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
& f(X1,X4) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',verify) ).
tff(mrel_reflexive,axiom,
! [X1: '$ki_world'] : '$ki_accessible'(X1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mrel_reflexive) ).
tff(c_0_2,negated_conjecture,
~ ( ! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> ? [X4] :
( '$ki_exists_in_world_$i'(X1,X4)
& f(X1,X4) ) )
=> ? [X4] :
( '$ki_exists_in_world_$i'('$ki_local_world',X4)
& ? [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
& f(X1,X4) ) ) ),
inference(assume_negation,[status(cth)],[verify]) ).
tff(c_0_3,negated_conjecture,
! [X5: '$ki_world',X7,X8: '$ki_world'] :
( ( '$ki_exists_in_world_$i'(X5,esk1_1(X5))
| ~ '$ki_accessible'('$ki_local_world',X5) )
& ( f(X5,esk1_1(X5))
| ~ '$ki_accessible'('$ki_local_world',X5) )
& ( ~ '$ki_exists_in_world_$i'('$ki_local_world',X7)
| ~ '$ki_accessible'('$ki_local_world',X8)
| ~ f(X8,X7) ) ),
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_2])])])])])]) ).
tcf(c_0_4,negated_conjecture,
! [X1: '$ki_world',X4] :
( ~ '$ki_exists_in_world_$i'('$ki_local_world',X4)
| ~ '$ki_accessible'('$ki_local_world',X1)
| ~ f(X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
tcf(c_0_5,negated_conjecture,
! [X1: '$ki_world'] :
( f(X1,esk1_1(X1))
| ~ '$ki_accessible'('$ki_local_world',X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
tff(c_0_6,plain,
! [X9: '$ki_world'] : '$ki_accessible'(X9,X9),
inference(variable_rename,[status(thm)],[mrel_reflexive]) ).
tcf(c_0_7,negated_conjecture,
! [X1: '$ki_world'] :
( ~ '$ki_exists_in_world_$i'('$ki_local_world',esk1_1(X1))
| ~ '$ki_accessible'('$ki_local_world',X1) ),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
tcf(c_0_8,negated_conjecture,
! [X1: '$ki_world'] :
( '$ki_exists_in_world_$i'(X1,esk1_1(X1))
| ~ '$ki_accessible'('$ki_local_world',X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
tcf(c_0_9,plain,
! [X1: '$ki_world'] : '$ki_accessible'(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SYO887_22 : TPTP v8.2.0. Released v8.2.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n008.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon May 20 10:23:08 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order model finding
% 0.20/0.48 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/benchmark/theBenchmark.p
% 0.20/0.49 # Version: 3.1.0
% 0.20/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.49 # Starting sh5l with 300s (1) cores
% 0.20/0.49 # new_bool_3 with pid 20831 completed with status 0
% 0.20/0.49 # Result found by new_bool_3
% 0.20/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.49 # Search class: FHHNS-FFSF11-SFFFFFNN
% 0.20/0.49 # partial match(1): FHHNF-FFSF11-SFFFFFNN
% 0.20/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.20/0.49 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 20835 completed with status 0
% 0.20/0.49 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.49 # Search class: FHHNS-FFSF11-SFFFFFNN
% 0.20/0.49 # partial match(1): FHHNF-FFSF11-SFFFFFNN
% 0.20/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.20/0.49 # Preprocessing time : 0.001 s
% 0.20/0.49 # Presaturation interreduction done
% 0.20/0.49
% 0.20/0.49 # Proof found!
% 0.20/0.49 # SZS status Theorem
% 0.20/0.49 # SZS output start CNFRefutation
% See solution above
% 0.20/0.49 # Parsed axioms : 10
% 0.20/0.49 # Removed by relevancy pruning/SinE : 5
% 0.20/0.49 # Initial clauses : 7
% 0.20/0.49 # Removed in clause preprocessing : 0
% 0.20/0.49 # Initial clauses in saturation : 7
% 0.20/0.49 # Processed clauses : 13
% 0.20/0.49 # ...of these trivial : 0
% 0.20/0.49 # ...subsumed : 0
% 0.20/0.49 # ...remaining for further processing : 13
% 0.20/0.49 # Other redundant clauses eliminated : 0
% 0.20/0.49 # Clauses deleted for lack of memory : 0
% 0.20/0.49 # Backward-subsumed : 0
% 0.20/0.49 # Backward-rewritten : 0
% 0.20/0.49 # Generated clauses : 2
% 0.20/0.49 # ...of the previous two non-redundant : 1
% 0.20/0.49 # ...aggressively subsumed : 0
% 0.20/0.49 # Contextual simplify-reflections : 0
% 0.20/0.49 # Paramodulations : 2
% 0.20/0.49 # Factorizations : 0
% 0.20/0.49 # NegExts : 0
% 0.20/0.49 # Equation resolutions : 0
% 0.20/0.49 # Disequality decompositions : 0
% 0.20/0.49 # Total rewrite steps : 1
% 0.20/0.49 # ...of those cached : 0
% 0.20/0.49 # Propositional unsat checks : 0
% 0.20/0.49 # Propositional check models : 0
% 0.20/0.49 # Propositional check unsatisfiable : 0
% 0.20/0.49 # Propositional clauses : 0
% 0.20/0.49 # Propositional clauses after purity: 0
% 0.20/0.49 # Propositional unsat core size : 0
% 0.20/0.49 # Propositional preprocessing time : 0.000
% 0.20/0.49 # Propositional encoding time : 0.000
% 0.20/0.49 # Propositional solver time : 0.000
% 0.20/0.49 # Success case prop preproc time : 0.000
% 0.20/0.49 # Success case prop encoding time : 0.000
% 0.20/0.49 # Success case prop solver time : 0.000
% 0.20/0.49 # Current number of processed clauses : 6
% 0.20/0.49 # Positive orientable unit clauses : 2
% 0.20/0.49 # Positive unorientable unit clauses: 0
% 0.20/0.49 # Negative unit clauses : 0
% 0.20/0.49 # Non-unit-clauses : 4
% 0.20/0.49 # Current number of unprocessed clauses: 2
% 0.20/0.49 # ...number of literals in the above : 6
% 0.20/0.49 # Current number of archived formulas : 0
% 0.20/0.49 # Current number of archived clauses : 7
% 0.20/0.49 # Clause-clause subsumption calls (NU) : 1
% 0.20/0.49 # Rec. Clause-clause subsumption calls : 0
% 0.20/0.49 # Non-unit clause-clause subsumptions : 0
% 0.20/0.49 # Unit Clause-clause subsumption calls : 0
% 0.20/0.49 # Rewrite failures with RHS unbound : 0
% 0.20/0.49 # BW rewrite match attempts : 0
% 0.20/0.49 # BW rewrite match successes : 0
% 0.20/0.49 # Condensation attempts : 0
% 0.20/0.49 # Condensation successes : 0
% 0.20/0.49 # Termbank termtop insertions : 595
% 0.20/0.49 # Search garbage collected termcells : 134
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.004 s
% 0.20/0.49 # System time : 0.002 s
% 0.20/0.49 # Total time : 0.006 s
% 0.20/0.49 # Maximum resident set size: 1768 pages
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.005 s
% 0.20/0.49 # System time : 0.004 s
% 0.20/0.49 # Total time : 0.009 s
% 0.20/0.49 # Maximum resident set size: 1712 pages
% 0.20/0.49 % E---3.1 exiting
%------------------------------------------------------------------------------