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