TSTP Solution File: SYO893_11 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYO893_11 : 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:31 EDT 2024
% Result : Theorem 0.21s 0.49s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 12
% Syntax : Number of formulae : 22 ( 5 unt; 10 typ; 0 def)
% Number of atoms : 85 ( 0 equ)
% Maximal formula atoms : 50 ( 7 avg)
% Number of connectives : 118 ( 45 ~; 47 |; 18 &)
% ( 2 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 7 ( 6 >; 1 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-1 aty)
% Number of variables : 35 ( 0 sgn 29 !; 6 ?; 35 :)
% 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,
p: '$ki_world' > $o ).
tff(decl_25,type,
esk1_1: '$ki_world' > '$ki_world' ).
tff(decl_26,type,
esk2_1: '$ki_world' > '$ki_world' ).
tff(decl_27,type,
esk3_0: '$ki_world' ).
tff(decl_28,type,
esk4_1: '$ki_world' > '$ki_world' ).
tff(decl_29,type,
esk5_0: '$ki_world' ).
tff(decl_30,type,
esk6_1: '$ki_world' > '$ki_world' ).
tff(verify,conjecture,
( ~ ! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> ? [X3: '$ki_world'] :
( '$ki_accessible'(X1,X3)
& ! [X4: '$ki_world'] :
( '$ki_accessible'(X3,X4)
=> p(X4) ) ) )
<=> ? [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
& ! [X3: '$ki_world'] :
( '$ki_accessible'(X1,X3)
=> ? [X4: '$ki_world'] :
( '$ki_accessible'(X3,X4)
& ~ p(X4) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',verify) ).
tff(mrel_universal,axiom,
! [X1: '$ki_world',X2: '$ki_world'] : '$ki_accessible'(X1,X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mrel_universal) ).
tff(c_0_2,negated_conjecture,
~ ( ~ ! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> ? [X3: '$ki_world'] :
( '$ki_accessible'(X1,X3)
& ! [X4: '$ki_world'] :
( '$ki_accessible'(X3,X4)
=> p(X4) ) ) )
<=> ? [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
& ! [X3: '$ki_world'] :
( '$ki_accessible'(X1,X3)
=> ? [X4: '$ki_world'] :
( '$ki_accessible'(X3,X4)
& ~ p(X4) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[verify])]) ).
tff(c_0_3,negated_conjecture,
! [X5: '$ki_world',X7: '$ki_world',X8: '$ki_world',X10: '$ki_world',X12: '$ki_world',X15: '$ki_world'] :
( ( '$ki_accessible'(X8,esk2_1(X8))
| ~ '$ki_accessible'('$ki_local_world',X8)
| '$ki_accessible'(X5,esk1_1(X5))
| ~ '$ki_accessible'('$ki_local_world',X5) )
& ( ~ '$ki_accessible'(esk2_1(X8),X10)
| p(X10)
| ~ '$ki_accessible'('$ki_local_world',X8)
| '$ki_accessible'(X5,esk1_1(X5))
| ~ '$ki_accessible'('$ki_local_world',X5) )
& ( '$ki_accessible'(X8,esk2_1(X8))
| ~ '$ki_accessible'('$ki_local_world',X8)
| ~ '$ki_accessible'(esk1_1(X5),X7)
| p(X7)
| ~ '$ki_accessible'('$ki_local_world',X5) )
& ( ~ '$ki_accessible'(esk2_1(X8),X10)
| p(X10)
| ~ '$ki_accessible'('$ki_local_world',X8)
| ~ '$ki_accessible'(esk1_1(X5),X7)
| p(X7)
| ~ '$ki_accessible'('$ki_local_world',X5) )
& ( '$ki_accessible'('$ki_local_world',esk5_0)
| '$ki_accessible'('$ki_local_world',esk3_0) )
& ( '$ki_accessible'(X15,esk6_1(X15))
| ~ '$ki_accessible'(esk5_0,X15)
| '$ki_accessible'('$ki_local_world',esk3_0) )
& ( ~ p(esk6_1(X15))
| ~ '$ki_accessible'(esk5_0,X15)
| '$ki_accessible'('$ki_local_world',esk3_0) )
& ( '$ki_accessible'('$ki_local_world',esk5_0)
| '$ki_accessible'(X12,esk4_1(X12))
| ~ '$ki_accessible'(esk3_0,X12) )
& ( '$ki_accessible'(X15,esk6_1(X15))
| ~ '$ki_accessible'(esk5_0,X15)
| '$ki_accessible'(X12,esk4_1(X12))
| ~ '$ki_accessible'(esk3_0,X12) )
& ( ~ p(esk6_1(X15))
| ~ '$ki_accessible'(esk5_0,X15)
| '$ki_accessible'(X12,esk4_1(X12))
| ~ '$ki_accessible'(esk3_0,X12) )
& ( '$ki_accessible'('$ki_local_world',esk5_0)
| ~ p(esk4_1(X12))
| ~ '$ki_accessible'(esk3_0,X12) )
& ( '$ki_accessible'(X15,esk6_1(X15))
| ~ '$ki_accessible'(esk5_0,X15)
| ~ p(esk4_1(X12))
| ~ '$ki_accessible'(esk3_0,X12) )
& ( ~ p(esk6_1(X15))
| ~ '$ki_accessible'(esk5_0,X15)
| ~ p(esk4_1(X12))
| ~ '$ki_accessible'(esk3_0,X12) ) ),
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,
! [X17: '$ki_world',X18: '$ki_world'] : '$ki_accessible'(X17,X18),
inference(variable_rename,[status(thm)],[mrel_universal]) ).
tcf(c_0_5,negated_conjecture,
! [X1: '$ki_world',X2: '$ki_world',X4: '$ki_world',X3: '$ki_world'] :
( p(X2)
| p(X4)
| ~ '$ki_accessible'(esk2_1(X1),X2)
| ~ '$ki_accessible'('$ki_local_world',X1)
| ~ '$ki_accessible'(esk1_1(X3),X4)
| ~ '$ki_accessible'('$ki_local_world',X3) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
tcf(c_0_6,plain,
! [X1: '$ki_world',X2: '$ki_world'] : '$ki_accessible'(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
tcf(c_0_7,negated_conjecture,
! [X1: '$ki_world',X2: '$ki_world'] :
( ~ p(esk6_1(X1))
| ~ '$ki_accessible'(esk5_0,X1)
| ~ p(esk4_1(X2))
| ~ '$ki_accessible'(esk3_0,X2) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
tcf(c_0_8,negated_conjecture,
! [X1: '$ki_world',X2: '$ki_world'] :
( p(X1)
| p(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_5,c_0_6]),c_0_6]),c_0_6]),c_0_6])]) ).
tcf(c_0_9,negated_conjecture,
! [X1: '$ki_world',X2: '$ki_world'] :
( ~ p(esk4_1(X1))
| ~ p(esk6_1(X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_6]),c_0_6])]) ).
tcf(c_0_10,negated_conjecture,
! [X1: '$ki_world'] : p(X1),
inference(ef,[status(thm)],[c_0_8]) ).
cnf(c_0_11,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10]),c_0_10])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SYO893_11 : TPTP v8.2.0. Released v8.2.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n002.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon May 20 09:18:52 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.21/0.47 Running first-order theorem proving
% 0.21/0.47 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.21/0.49 # Version: 3.1.0
% 0.21/0.49 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.49 # Starting sh5l with 300s (1) cores
% 0.21/0.49 # new_bool_3 with pid 6222 completed with status 0
% 0.21/0.49 # Result found by new_bool_3
% 0.21/0.49 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.49 # Search class: FGHNF-FFSF11-SFFFFFNN
% 0.21/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.49 # SAT001_MinMin_p005000_rr_RG with pid 6230 completed with status 0
% 0.21/0.49 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.49 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.49 # Search class: FGHNF-FFSF11-SFFFFFNN
% 0.21/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.49 # Preprocessing time : 0.001 s
% 0.21/0.49 # Presaturation interreduction done
% 0.21/0.49
% 0.21/0.49 # Proof found!
% 0.21/0.49 # SZS status Theorem
% 0.21/0.49 # SZS output start CNFRefutation
% See solution above
% 0.21/0.49 # Parsed axioms : 6
% 0.21/0.49 # Removed by relevancy pruning/SinE : 4
% 0.21/0.49 # Initial clauses : 14
% 0.21/0.49 # Removed in clause preprocessing : 0
% 0.21/0.49 # Initial clauses in saturation : 14
% 0.21/0.49 # Processed clauses : 18
% 0.21/0.49 # ...of these trivial : 11
% 0.21/0.49 # ...subsumed : 0
% 0.21/0.49 # ...remaining for further processing : 7
% 0.21/0.49 # Other redundant clauses eliminated : 0
% 0.21/0.49 # Clauses deleted for lack of memory : 0
% 0.21/0.49 # Backward-subsumed : 1
% 0.21/0.49 # Backward-rewritten : 1
% 0.21/0.49 # Generated clauses : 4
% 0.21/0.49 # ...of the previous two non-redundant : 4
% 0.21/0.49 # ...aggressively subsumed : 0
% 0.21/0.49 # Contextual simplify-reflections : 0
% 0.21/0.49 # Paramodulations : 2
% 0.21/0.49 # Factorizations : 2
% 0.21/0.49 # NegExts : 0
% 0.21/0.49 # Equation resolutions : 0
% 0.21/0.49 # Disequality decompositions : 0
% 0.21/0.49 # Total rewrite steps : 42
% 0.21/0.49 # ...of those cached : 21
% 0.21/0.49 # Propositional unsat checks : 0
% 0.21/0.49 # Propositional check models : 0
% 0.21/0.49 # Propositional check unsatisfiable : 0
% 0.21/0.49 # Propositional clauses : 0
% 0.21/0.49 # Propositional clauses after purity: 0
% 0.21/0.49 # Propositional unsat core size : 0
% 0.21/0.49 # Propositional preprocessing time : 0.000
% 0.21/0.49 # Propositional encoding time : 0.000
% 0.21/0.49 # Propositional solver time : 0.000
% 0.21/0.49 # Success case prop preproc time : 0.000
% 0.21/0.49 # Success case prop encoding time : 0.000
% 0.21/0.49 # Success case prop solver time : 0.000
% 0.21/0.49 # Current number of processed clauses : 2
% 0.21/0.49 # Positive orientable unit clauses : 2
% 0.21/0.49 # Positive unorientable unit clauses: 0
% 0.21/0.49 # Negative unit clauses : 0
% 0.21/0.49 # Non-unit-clauses : 0
% 0.21/0.49 # Current number of unprocessed clauses: 3
% 0.21/0.49 # ...number of literals in the above : 5
% 0.21/0.49 # Current number of archived formulas : 0
% 0.21/0.49 # Current number of archived clauses : 5
% 0.21/0.49 # Clause-clause subsumption calls (NU) : 0
% 0.21/0.49 # Rec. Clause-clause subsumption calls : 0
% 0.21/0.49 # Non-unit clause-clause subsumptions : 0
% 0.21/0.49 # Unit Clause-clause subsumption calls : 1
% 0.21/0.49 # Rewrite failures with RHS unbound : 0
% 0.21/0.49 # BW rewrite match attempts : 4
% 0.21/0.49 # BW rewrite match successes : 4
% 0.21/0.49 # Condensation attempts : 0
% 0.21/0.49 # Condensation successes : 0
% 0.21/0.49 # Termbank termtop insertions : 1008
% 0.21/0.49 # Search garbage collected termcells : 219
% 0.21/0.49
% 0.21/0.49 # -------------------------------------------------
% 0.21/0.49 # User time : 0.004 s
% 0.21/0.49 # System time : 0.001 s
% 0.21/0.49 # Total time : 0.005 s
% 0.21/0.49 # Maximum resident set size: 1704 pages
% 0.21/0.49
% 0.21/0.49 # -------------------------------------------------
% 0.21/0.49 # User time : 0.004 s
% 0.21/0.49 # System time : 0.004 s
% 0.21/0.49 # Total time : 0.008 s
% 0.21/0.49 # Maximum resident set size: 1700 pages
% 0.21/0.49 % E---3.1 exiting
% 0.21/0.49 % E exiting
%------------------------------------------------------------------------------