TSTP Solution File: SYO894_8 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SYO894_8 : TPTP v8.2.0. Released v8.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n003.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.19s 0.48s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 7
% Syntax : Number of formulae : 24 ( 4 unt; 6 typ; 0 def)
% Number of atoms : 62 ( 0 equ)
% Maximal formula atoms : 17 ( 3 avg)
% Number of connectives : 75 ( 31 ~; 30 |; 8 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 3 ( 2 >; 1 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 15 ( 0 sgn 13 !; 2 ?; 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,
p: '$ki_world' > $o ).
tff(decl_25,type,
esk1_0: '$ki_world' ).
tff(decl_26,type,
esk2_0: '$ki_world' ).
tff(verify,conjecture,
( ! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> ( p(X1)
=> ~ p(X1) ) )
<=> ~ ? [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
& p(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',verify) ).
tff(c_0_1,negated_conjecture,
~ ( ! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> ( p(X1)
=> ~ p(X1) ) )
<=> ~ ? [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
& p(X1) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[verify])]) ).
tff(c_0_2,negated_conjecture,
! [X4: '$ki_world',X5: '$ki_world'] :
( ( '$ki_accessible'('$ki_local_world',esk2_0)
| '$ki_accessible'('$ki_local_world',esk1_0) )
& ( p(esk2_0)
| '$ki_accessible'('$ki_local_world',esk1_0) )
& ( '$ki_accessible'('$ki_local_world',esk2_0)
| p(esk1_0) )
& ( p(esk2_0)
| p(esk1_0) )
& ( '$ki_accessible'('$ki_local_world',esk2_0)
| p(esk1_0) )
& ( p(esk2_0)
| p(esk1_0) )
& ( ~ '$ki_accessible'('$ki_local_world',X4)
| ~ p(X4)
| ~ p(X4)
| ~ '$ki_accessible'('$ki_local_world',X5)
| ~ p(X5) ) ),
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'] :
( ~ '$ki_accessible'('$ki_local_world',X1)
| ~ p(X1)
| ~ p(X1)
| ~ '$ki_accessible'('$ki_local_world',X2)
| ~ p(X2) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
tcf(c_0_4,negated_conjecture,
! [X2: '$ki_world',X1: '$ki_world'] :
( ~ p(X2)
| ~ p(X1)
| ~ '$ki_accessible'('$ki_local_world',X2)
| ~ '$ki_accessible'('$ki_local_world',X1) ),
inference(cn,[status(thm)],[c_0_3]) ).
tcf(c_0_5,negated_conjecture,
( '$ki_accessible'('$ki_local_world',esk2_0)
| '$ki_accessible'('$ki_local_world',esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
tcf(c_0_6,negated_conjecture,
( p(esk2_0)
| '$ki_accessible'('$ki_local_world',esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
tcf(c_0_7,negated_conjecture,
! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',esk1_0)
| ~ p(X1)
| ~ '$ki_accessible'('$ki_local_world',X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_5]),c_0_6]) ).
tcf(c_0_8,negated_conjecture,
'$ki_accessible'('$ki_local_world',esk1_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_6]),c_0_5]) ).
tcf(c_0_9,negated_conjecture,
! [X1: '$ki_world'] :
( ~ p(esk1_0)
| ~ p(X1)
| ~ '$ki_accessible'('$ki_local_world',X1) ),
inference(spm,[status(thm)],[c_0_4,c_0_8]) ).
tcf(c_0_10,negated_conjecture,
( '$ki_accessible'('$ki_local_world',esk2_0)
| p(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
tcf(c_0_11,negated_conjecture,
! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',esk2_0)
| ~ p(X1)
| ~ '$ki_accessible'('$ki_local_world',X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
tcf(c_0_12,negated_conjecture,
'$ki_accessible'('$ki_local_world',esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_10]),c_0_8])]) ).
tcf(c_0_13,negated_conjecture,
! [X1: '$ki_world'] :
( ~ p(esk2_0)
| ~ p(X1)
| ~ '$ki_accessible'('$ki_local_world',X1) ),
inference(spm,[status(thm)],[c_0_4,c_0_12]) ).
tcf(c_0_14,negated_conjecture,
( p(esk2_0)
| p(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
tcf(c_0_15,negated_conjecture,
! [X1: '$ki_world'] :
( ~ p(X1)
| ~ '$ki_accessible'('$ki_local_world',X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_9]) ).
tcf(c_0_16,negated_conjecture,
p(esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_14]),c_0_12])]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_8])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYO894_8 : TPTP v8.2.0. Released v8.2.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n003.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 10:57:52 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order model finding
% 0.19/0.47 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.19/0.48 # Version: 3.1.0
% 0.19/0.48 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.48 # Starting sh5l with 300s (1) cores
% 0.19/0.48 # new_bool_3 with pid 21275 completed with status 0
% 0.19/0.48 # Result found by new_bool_3
% 0.19/0.48 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.48 # Search class: FGHNF-FFSM00-SFFFFFNN
% 0.19/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.48 # Starting G----_406_C05_02_F1_SE_CS_SP_PS_RG_S04AI with 181s (1) cores
% 0.19/0.48 # G----_406_C05_02_F1_SE_CS_SP_PS_RG_S04AI with pid 21283 completed with status 0
% 0.19/0.48 # Result found by G----_406_C05_02_F1_SE_CS_SP_PS_RG_S04AI
% 0.19/0.48 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.48 # Search class: FGHNF-FFSM00-SFFFFFNN
% 0.19/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.48 # Starting G----_406_C05_02_F1_SE_CS_SP_PS_RG_S04AI with 181s (1) cores
% 0.19/0.48 # Preprocessing time : 0.001 s
% 0.19/0.48 # Presaturation interreduction done
% 0.19/0.48
% 0.19/0.48 # Proof found!
% 0.19/0.48 # SZS status Theorem
% 0.19/0.48 # SZS output start CNFRefutation
% See solution above
% 0.19/0.48 # Parsed axioms : 6
% 0.19/0.48 # Removed by relevancy pruning/SinE : 4
% 0.19/0.48 # Initial clauses : 8
% 0.19/0.48 # Removed in clause preprocessing : 0
% 0.19/0.48 # Initial clauses in saturation : 8
% 0.19/0.48 # Processed clauses : 23
% 0.19/0.48 # ...of these trivial : 0
% 0.19/0.48 # ...subsumed : 2
% 0.19/0.48 # ...remaining for further processing : 21
% 0.19/0.48 # Other redundant clauses eliminated : 0
% 0.19/0.48 # Clauses deleted for lack of memory : 0
% 0.19/0.48 # Backward-subsumed : 4
% 0.19/0.48 # Backward-rewritten : 6
% 0.19/0.48 # Generated clauses : 13
% 0.19/0.48 # ...of the previous two non-redundant : 10
% 0.19/0.48 # ...aggressively subsumed : 0
% 0.19/0.48 # Contextual simplify-reflections : 3
% 0.19/0.48 # Paramodulations : 13
% 0.19/0.48 # Factorizations : 0
% 0.19/0.48 # NegExts : 0
% 0.19/0.48 # Equation resolutions : 0
% 0.19/0.48 # Disequality decompositions : 0
% 0.19/0.48 # Total rewrite steps : 9
% 0.19/0.48 # ...of those cached : 6
% 0.19/0.48 # Propositional unsat checks : 0
% 0.19/0.48 # Propositional check models : 0
% 0.19/0.48 # Propositional check unsatisfiable : 0
% 0.19/0.48 # Propositional clauses : 0
% 0.19/0.48 # Propositional clauses after purity: 0
% 0.19/0.48 # Propositional unsat core size : 0
% 0.19/0.48 # Propositional preprocessing time : 0.000
% 0.19/0.48 # Propositional encoding time : 0.000
% 0.19/0.48 # Propositional solver time : 0.000
% 0.19/0.48 # Success case prop preproc time : 0.000
% 0.19/0.48 # Success case prop encoding time : 0.000
% 0.19/0.48 # Success case prop solver time : 0.000
% 0.19/0.48 # Current number of processed clauses : 5
% 0.19/0.48 # Positive orientable unit clauses : 4
% 0.19/0.48 # Positive unorientable unit clauses: 0
% 0.19/0.48 # Negative unit clauses : 0
% 0.19/0.48 # Non-unit-clauses : 1
% 0.19/0.48 # Current number of unprocessed clauses: 0
% 0.19/0.48 # ...number of literals in the above : 0
% 0.19/0.48 # Current number of archived formulas : 0
% 0.19/0.48 # Current number of archived clauses : 16
% 0.19/0.48 # Clause-clause subsumption calls (NU) : 21
% 0.19/0.48 # Rec. Clause-clause subsumption calls : 13
% 0.19/0.48 # Non-unit clause-clause subsumptions : 9
% 0.19/0.48 # Unit Clause-clause subsumption calls : 1
% 0.19/0.48 # Rewrite failures with RHS unbound : 0
% 0.19/0.48 # BW rewrite match attempts : 7
% 0.19/0.48 # BW rewrite match successes : 3
% 0.19/0.48 # Condensation attempts : 0
% 0.19/0.48 # Condensation successes : 0
% 0.19/0.48 # Termbank termtop insertions : 690
% 0.19/0.48 # Search garbage collected termcells : 98
% 0.19/0.48
% 0.19/0.48 # -------------------------------------------------
% 0.19/0.48 # User time : 0.005 s
% 0.19/0.48 # System time : 0.000 s
% 0.19/0.48 # Total time : 0.005 s
% 0.19/0.48 # Maximum resident set size: 1756 pages
% 0.19/0.48
% 0.19/0.48 # -------------------------------------------------
% 0.19/0.48 # User time : 0.007 s
% 0.19/0.48 # System time : 0.002 s
% 0.19/0.48 # Total time : 0.008 s
% 0.19/0.48 # Maximum resident set size: 1708 pages
% 0.19/0.48 % E---3.1 exiting
%------------------------------------------------------------------------------