TSTP Solution File: PLA053_5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : PLA053_5 : 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 02:19:23 EDT 2024
% Result : Theorem 0.20s 0.50s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 14
% Syntax : Number of formulae : 31 ( 10 unt; 10 typ; 0 def)
% Number of atoms : 63 ( 0 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 67 ( 25 ~; 21 |; 11 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 12 ( 6 >; 6 *; 0 +; 0 <<)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 37 ( 0 sgn 34 !; 3 ?; 19 :)
% 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,
h: ( '$ki_world' * $i ) > $o ).
tff(decl_25,type,
bomb: ( '$ki_world' * $i ) > $o ).
tff(decl_26,type,
defused: ( '$ki_world' * $i ) > $o ).
tff(decl_27,type,
'$ki_exists_in_world_$i': ( '$ki_world' * $i ) > $o ).
tff(decl_31,type,
esk4_2: ( '$ki_world' * $i ) > $i ).
tff(decl_32,type,
esk5_0: '$ki_world' ).
tff(decl_33,type,
esk6_0: $i ).
tff(verify,conjecture,
! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> ! [X3] :
( '$ki_exists_in_world_$i'(X1,X3)
=> ? [X7] :
( '$ki_exists_in_world_$i'(X1,X7)
& ( ( bomb(X1,X3)
& h(X1,X7) )
=> defused(X1,X3) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',verify) ).
tff(ax3,axiom,
! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> ! [X3] :
( '$ki_exists_in_world_$i'(X1,X3)
=> ? [X7] :
( '$ki_exists_in_world_$i'(X1,X7)
& ! [X6: '$ki_world'] :
( '$ki_accessible'(X1,X6)
=> ( ( bomb(X6,X3)
& h(X6,X7) )
=> defused(X6,X3) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax3) ).
tff('$ki_exists_in_world_$i_const',axiom,
! [X1: '$ki_world',X3] : '$ki_exists_in_world_$i'(X1,X3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','$ki_exists_in_world_$i_const') ).
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_4,negated_conjecture,
~ ! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> ! [X3] :
( '$ki_exists_in_world_$i'(X1,X3)
=> ? [X7] :
( '$ki_exists_in_world_$i'(X1,X7)
& ( ( bomb(X1,X3)
& h(X1,X7) )
=> defused(X1,X3) ) ) ) ),
inference(assume_negation,[status(cth)],[verify]) ).
tff(c_0_5,plain,
! [X20: '$ki_world',X21,X23: '$ki_world'] :
( ( '$ki_exists_in_world_$i'(X20,esk4_2(X20,X21))
| ~ '$ki_exists_in_world_$i'(X20,X21)
| ~ '$ki_accessible'('$ki_local_world',X20) )
& ( ~ '$ki_accessible'(X20,X23)
| ~ bomb(X23,X21)
| ~ h(X23,esk4_2(X20,X21))
| defused(X23,X21)
| ~ '$ki_exists_in_world_$i'(X20,X21)
| ~ '$ki_accessible'('$ki_local_world',X20) ) ),
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)],[ax3])])])])])]) ).
tff(c_0_6,plain,
! [X10: '$ki_world',X11] : '$ki_exists_in_world_$i'(X10,X11),
inference(variable_rename,[status(thm)],['$ki_exists_in_world_$i_const']) ).
tff(c_0_7,plain,
! [X8: '$ki_world',X9: '$ki_world'] : '$ki_accessible'(X8,X9),
inference(variable_rename,[status(thm)],[mrel_universal]) ).
tff(c_0_8,negated_conjecture,
! [X26] :
( '$ki_accessible'('$ki_local_world',esk5_0)
& '$ki_exists_in_world_$i'(esk5_0,esk6_0)
& ( bomb(esk5_0,esk6_0)
| ~ '$ki_exists_in_world_$i'(esk5_0,X26) )
& ( h(esk5_0,X26)
| ~ '$ki_exists_in_world_$i'(esk5_0,X26) )
& ( ~ defused(esk5_0,esk6_0)
| ~ '$ki_exists_in_world_$i'(esk5_0,X26) ) ),
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_4])])])])])]) ).
tcf(c_0_9,plain,
! [X3,X2: '$ki_world',X1: '$ki_world'] :
( defused(X2,X3)
| ~ '$ki_accessible'(X1,X2)
| ~ bomb(X2,X3)
| ~ h(X2,esk4_2(X1,X3))
| ~ '$ki_exists_in_world_$i'(X1,X3)
| ~ '$ki_accessible'('$ki_local_world',X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
tcf(c_0_10,plain,
! [X1: '$ki_world',X3] : '$ki_exists_in_world_$i'(X1,X3),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
tcf(c_0_11,plain,
! [X1: '$ki_world',X2: '$ki_world'] : '$ki_accessible'(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
tcf(c_0_12,negated_conjecture,
! [X3] :
( h(esk5_0,X3)
| ~ '$ki_exists_in_world_$i'(esk5_0,X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
tcf(c_0_13,negated_conjecture,
! [X3] :
( ~ defused(esk5_0,esk6_0)
| ~ '$ki_exists_in_world_$i'(esk5_0,X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
tcf(c_0_14,plain,
! [X1: '$ki_world',X2: '$ki_world',X3] :
( defused(X2,X3)
| ~ bomb(X2,X3)
| ~ h(X2,esk4_2(X1,X3)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10])]),c_0_11]),c_0_11])]) ).
tcf(c_0_15,negated_conjecture,
! [X3] : h(esk5_0,X3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_10])]) ).
tcf(c_0_16,negated_conjecture,
! [X3] :
( bomb(esk5_0,esk6_0)
| ~ '$ki_exists_in_world_$i'(esk5_0,X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
tcf(c_0_17,negated_conjecture,
~ defused(esk5_0,esk6_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_10])]) ).
tcf(c_0_18,negated_conjecture,
! [X3] :
( defused(esk5_0,X3)
| ~ bomb(esk5_0,X3) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
tcf(c_0_19,negated_conjecture,
bomb(esk5_0,esk6_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_10])]) ).
cnf(c_0_20,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : PLA053_5 : TPTP v8.2.0. Released v8.2.0.
% 0.08/0.13 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n003.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sat May 18 13:39:53 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 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.20/0.50 # Version: 3.1.0
% 0.20/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.50 # Starting sh5l with 300s (1) cores
% 0.20/0.50 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 20492 completed with status 0
% 0.20/0.50 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.50 # No SInE strategy applied
% 0.20/0.50 # Search class: FHUNS-FFSF21-SFFFFFNN
% 0.20/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.50 # Starting G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.20/0.50 # Starting new_bool_3 with 136s (1) cores
% 0.20/0.50 # Starting new_bool_1 with 136s (1) cores
% 0.20/0.50 # Starting sh5l with 136s (1) cores
% 0.20/0.50 # G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN with pid 20496 completed with status 0
% 0.20/0.50 # Result found by G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN
% 0.20/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.50 # No SInE strategy applied
% 0.20/0.50 # Search class: FHUNS-FFSF21-SFFFFFNN
% 0.20/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.50 # Starting G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.20/0.50 # Preprocessing time : 0.001 s
% 0.20/0.50 # Presaturation interreduction done
% 0.20/0.50
% 0.20/0.50 # Proof found!
% 0.20/0.50 # SZS status Theorem
% 0.20/0.50 # SZS output start CNFRefutation
% See solution above
% 0.20/0.50 # Parsed axioms : 14
% 0.20/0.50 # Removed by relevancy pruning/SinE : 0
% 0.20/0.50 # Initial clauses : 21
% 0.20/0.50 # Removed in clause preprocessing : 15
% 0.20/0.50 # Initial clauses in saturation : 6
% 0.20/0.50 # Processed clauses : 13
% 0.20/0.50 # ...of these trivial : 0
% 0.20/0.50 # ...subsumed : 0
% 0.20/0.50 # ...remaining for further processing : 13
% 0.20/0.50 # Other redundant clauses eliminated : 0
% 0.20/0.50 # Clauses deleted for lack of memory : 0
% 0.20/0.50 # Backward-subsumed : 0
% 0.20/0.50 # Backward-rewritten : 0
% 0.20/0.50 # Generated clauses : 3
% 0.20/0.50 # ...of the previous two non-redundant : 2
% 0.20/0.50 # ...aggressively subsumed : 0
% 0.20/0.50 # Contextual simplify-reflections : 0
% 0.20/0.50 # Paramodulations : 3
% 0.20/0.50 # Factorizations : 0
% 0.20/0.50 # NegExts : 0
% 0.20/0.50 # Equation resolutions : 0
% 0.20/0.50 # Disequality decompositions : 0
% 0.20/0.50 # Total rewrite steps : 1
% 0.20/0.50 # ...of those cached : 0
% 0.20/0.50 # Propositional unsat checks : 0
% 0.20/0.50 # Propositional check models : 0
% 0.20/0.50 # Propositional check unsatisfiable : 0
% 0.20/0.50 # Propositional clauses : 0
% 0.20/0.50 # Propositional clauses after purity: 0
% 0.20/0.50 # Propositional unsat core size : 0
% 0.20/0.50 # Propositional preprocessing time : 0.000
% 0.20/0.50 # Propositional encoding time : 0.000
% 0.20/0.50 # Propositional solver time : 0.000
% 0.20/0.50 # Success case prop preproc time : 0.000
% 0.20/0.50 # Success case prop encoding time : 0.000
% 0.20/0.50 # Success case prop solver time : 0.000
% 0.20/0.50 # Current number of processed clauses : 7
% 0.20/0.50 # Positive orientable unit clauses : 3
% 0.20/0.50 # Positive unorientable unit clauses: 0
% 0.20/0.50 # Negative unit clauses : 1
% 0.20/0.50 # Non-unit-clauses : 3
% 0.20/0.50 # Current number of unprocessed clauses: 1
% 0.20/0.50 # ...number of literals in the above : 2
% 0.20/0.50 # Current number of archived formulas : 0
% 0.20/0.50 # Current number of archived clauses : 8
% 0.20/0.50 # Clause-clause subsumption calls (NU) : 0
% 0.20/0.50 # Rec. Clause-clause subsumption calls : 0
% 0.20/0.50 # Non-unit clause-clause subsumptions : 0
% 0.20/0.50 # Unit Clause-clause subsumption calls : 0
% 0.20/0.50 # Rewrite failures with RHS unbound : 0
% 0.20/0.50 # BW rewrite match attempts : 0
% 0.20/0.50 # BW rewrite match successes : 0
% 0.20/0.50 # Condensation attempts : 0
% 0.20/0.50 # Condensation successes : 0
% 0.20/0.50 # Termbank termtop insertions : 947
% 0.20/0.50 # Search garbage collected termcells : 252
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.002 s
% 0.20/0.50 # System time : 0.005 s
% 0.20/0.50 # Total time : 0.007 s
% 0.20/0.50 # Maximum resident set size: 1768 pages
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.010 s
% 0.20/0.50 # System time : 0.009 s
% 0.20/0.50 # Total time : 0.019 s
% 0.20/0.50 # Maximum resident set size: 1712 pages
% 0.20/0.50 % E---3.1 exiting
% 0.20/0.50 % E exiting
%------------------------------------------------------------------------------