TSTP Solution File: SYO901_11 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SYO901_11 : TPTP v8.2.0. Released v8.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n012.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:16 EDT 2024
% Result : Theorem 0.20s 0.47s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of formulae : 24 ( 6 unt; 8 typ; 0 def)
% Number of atoms : 59 ( 0 equ)
% Maximal formula atoms : 19 ( 3 avg)
% Number of connectives : 64 ( 21 ~; 22 |; 7 &)
% ( 4 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 4 ( 3 >; 1 *; 0 +; 0 <<)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 27 ( 0 sgn 27 !; 0 ?; 27 :)
% 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,
q: '$ki_world' > $o ).
tff(decl_26,type,
esk1_0: '$ki_world' ).
tff(decl_27,type,
esk2_0: '$ki_world' ).
tff(decl_28,type,
esk3_0: '$ki_world' ).
tff(verify,conjecture,
( ! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> ( p(X1)
<=> q(X1) ) )
=> ! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> ( ! [X3: '$ki_world'] :
( '$ki_accessible'(X1,X3)
=> p(X3) )
<=> ! [X3: '$ki_world'] :
( '$ki_accessible'(X1,X3)
=> q(X3) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',verify) ).
tff(mrel_universal,axiom,
! [X1: '$ki_world',X2: '$ki_world'] : '$ki_accessible'(X1,X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mrel_universal) ).
tff(c_0_2,negated_conjecture,
~ ( ! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> ( p(X1)
<=> q(X1) ) )
=> ! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> ( ! [X3: '$ki_world'] :
( '$ki_accessible'(X1,X3)
=> p(X3) )
<=> ! [X3: '$ki_world'] :
( '$ki_accessible'(X1,X3)
=> q(X3) ) ) ) ),
inference(assume_negation,[status(cth)],[verify]) ).
tff(c_0_3,negated_conjecture,
! [X6: '$ki_world',X10: '$ki_world',X11: '$ki_world'] :
( ( ~ p(X6)
| q(X6)
| ~ '$ki_accessible'('$ki_local_world',X6) )
& ( ~ q(X6)
| p(X6)
| ~ '$ki_accessible'('$ki_local_world',X6) )
& '$ki_accessible'('$ki_local_world',esk1_0)
& ( '$ki_accessible'(esk1_0,esk3_0)
| '$ki_accessible'(esk1_0,esk2_0) )
& ( ~ q(esk3_0)
| '$ki_accessible'(esk1_0,esk2_0) )
& ( '$ki_accessible'(esk1_0,esk3_0)
| ~ p(esk2_0) )
& ( ~ q(esk3_0)
| ~ p(esk2_0) )
& ( ~ '$ki_accessible'(esk1_0,X10)
| p(X10)
| ~ '$ki_accessible'(esk1_0,X11)
| q(X11) ) ),
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,
! [X4: '$ki_world',X5: '$ki_world'] : '$ki_accessible'(X4,X5),
inference(variable_rename,[status(thm)],[mrel_universal]) ).
tcf(c_0_5,negated_conjecture,
! [X1: '$ki_world'] :
( p(X1)
| ~ q(X1)
| ~ '$ki_accessible'('$ki_local_world',X1) ),
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(X1)
| q(X2)
| ~ '$ki_accessible'(esk1_0,X1)
| ~ '$ki_accessible'(esk1_0,X2) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
tcf(c_0_8,negated_conjecture,
! [X1: '$ki_world'] :
( q(X1)
| ~ p(X1)
| ~ '$ki_accessible'('$ki_local_world',X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
tcf(c_0_9,negated_conjecture,
! [X1: '$ki_world'] :
( p(X1)
| ~ q(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_5,c_0_6])]) ).
tcf(c_0_10,negated_conjecture,
! [X1: '$ki_world',X2: '$ki_world'] :
( p(X1)
| q(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_11,negated_conjecture,
! [X1: '$ki_world'] :
( q(X1)
| ~ p(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_6])]) ).
tcf(c_0_12,negated_conjecture,
! [X1: '$ki_world'] : p(X1),
inference(csr,[status(thm)],[c_0_9,c_0_10]) ).
tcf(c_0_13,negated_conjecture,
( ~ q(esk3_0)
| ~ p(esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
tcf(c_0_14,negated_conjecture,
! [X1: '$ki_world'] : q(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12])]) ).
cnf(c_0_15,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_12])]),c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYO901_11 : TPTP v8.2.0. Released v8.2.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n012.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 08:59:38 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.46 Running first-order model finding
% 0.20/0.46 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.47 # Version: 3.1.0
% 0.20/0.47 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.47 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.47 # Starting sh5l with 300s (1) cores
% 0.20/0.47 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 2267 completed with status 0
% 0.20/0.47 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.20/0.47 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.47 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.47 # No SInE strategy applied
% 0.20/0.47 # Search class: FGHNF-FFSF00-SFFFFFNN
% 0.20/0.47 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.47 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.20/0.47 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.20/0.47 # Starting new_bool_3 with 136s (1) cores
% 0.20/0.47 # Starting new_bool_1 with 136s (1) cores
% 0.20/0.47 # Starting sh5l with 136s (1) cores
% 0.20/0.47 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 2272 completed with status 0
% 0.20/0.47 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.20/0.47 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.47 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.47 # No SInE strategy applied
% 0.20/0.47 # Search class: FGHNF-FFSF00-SFFFFFNN
% 0.20/0.47 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.47 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.20/0.47 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.20/0.47 # Preprocessing time : 0.001 s
% 0.20/0.47
% 0.20/0.47 # Proof found!
% 0.20/0.47 # SZS status Theorem
% 0.20/0.47 # SZS output start CNFRefutation
% See solution above
% 0.20/0.47 # Parsed axioms : 7
% 0.20/0.47 # Removed by relevancy pruning/SinE : 0
% 0.20/0.47 # Initial clauses : 14
% 0.20/0.47 # Removed in clause preprocessing : 10
% 0.20/0.47 # Initial clauses in saturation : 4
% 0.20/0.47 # Processed clauses : 5
% 0.20/0.47 # ...of these trivial : 0
% 0.20/0.47 # ...subsumed : 0
% 0.20/0.47 # ...remaining for further processing : 4
% 0.20/0.47 # Other redundant clauses eliminated : 0
% 0.20/0.47 # Clauses deleted for lack of memory : 0
% 0.20/0.47 # Backward-subsumed : 1
% 0.20/0.47 # Backward-rewritten : 1
% 0.20/0.47 # Generated clauses : 1
% 0.20/0.47 # ...of the previous two non-redundant : 2
% 0.20/0.47 # ...aggressively subsumed : 0
% 0.20/0.47 # Contextual simplify-reflections : 1
% 0.20/0.47 # Paramodulations : 1
% 0.20/0.47 # Factorizations : 0
% 0.20/0.47 # NegExts : 0
% 0.20/0.47 # Equation resolutions : 0
% 0.20/0.47 # Disequality decompositions : 0
% 0.20/0.47 # Total rewrite steps : 3
% 0.20/0.47 # ...of those cached : 0
% 0.20/0.47 # Propositional unsat checks : 0
% 0.20/0.47 # Propositional check models : 0
% 0.20/0.47 # Propositional check unsatisfiable : 0
% 0.20/0.47 # Propositional clauses : 0
% 0.20/0.47 # Propositional clauses after purity: 0
% 0.20/0.47 # Propositional unsat core size : 0
% 0.20/0.47 # Propositional preprocessing time : 0.000
% 0.20/0.47 # Propositional encoding time : 0.000
% 0.20/0.47 # Propositional solver time : 0.000
% 0.20/0.47 # Success case prop preproc time : 0.000
% 0.20/0.47 # Success case prop encoding time : 0.000
% 0.20/0.47 # Success case prop solver time : 0.000
% 0.20/0.47 # Current number of processed clauses : 2
% 0.20/0.47 # Positive orientable unit clauses : 2
% 0.20/0.47 # Positive unorientable unit clauses: 0
% 0.20/0.47 # Negative unit clauses : 0
% 0.20/0.47 # Non-unit-clauses : 0
% 0.20/0.47 # Current number of unprocessed clauses: 0
% 0.20/0.47 # ...number of literals in the above : 0
% 0.20/0.47 # Current number of archived formulas : 0
% 0.20/0.47 # Current number of archived clauses : 3
% 0.20/0.47 # Clause-clause subsumption calls (NU) : 1
% 0.20/0.47 # Rec. Clause-clause subsumption calls : 1
% 0.20/0.47 # Non-unit clause-clause subsumptions : 1
% 0.20/0.47 # Unit Clause-clause subsumption calls : 1
% 0.20/0.47 # Rewrite failures with RHS unbound : 0
% 0.20/0.47 # BW rewrite match attempts : 2
% 0.20/0.47 # BW rewrite match successes : 2
% 0.20/0.47 # Condensation attempts : 0
% 0.20/0.47 # Condensation successes : 0
% 0.20/0.47 # Termbank termtop insertions : 630
% 0.20/0.47 # Search garbage collected termcells : 193
% 0.20/0.47
% 0.20/0.47 # -------------------------------------------------
% 0.20/0.47 # User time : 0.001 s
% 0.20/0.47 # System time : 0.004 s
% 0.20/0.47 # Total time : 0.004 s
% 0.20/0.47 # Maximum resident set size: 1704 pages
% 0.20/0.47
% 0.20/0.47 # -------------------------------------------------
% 0.20/0.47 # User time : 0.007 s
% 0.20/0.47 # System time : 0.007 s
% 0.20/0.47 # Total time : 0.015 s
% 0.20/0.47 # Maximum resident set size: 1700 pages
% 0.20/0.47 % E---3.1 exiting
%------------------------------------------------------------------------------