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