TSTP Solution File: PLA053_4 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : PLA053_4 : TPTP v8.2.0. Released v8.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n021.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:22 EDT 2024
% Result : Theorem 0.21s 0.48s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 14
% Syntax : Number of formulae : 33 ( 11 unt; 10 typ; 0 def)
% Number of atoms : 70 ( 0 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 77 ( 30 ~; 26 |; 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 : 36 ( 0 sgn 33 !; 3 ?; 17 :)
% 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_28,type,
esk1_0: '$ki_world' ).
tff(decl_29,type,
esk2_0: $i ).
tff(decl_30,type,
esk3_2: ( '$ki_world' * $i ) > $i ).
tff(verify,conjecture,
! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> ! [X4] :
( '$ki_exists_in_world_$i'(X1,X4)
=> ? [X8] :
( '$ki_exists_in_world_$i'(X1,X8)
& ( ( bomb(X1,X4)
& h(X1,X8) )
=> defused(X1,X4) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',verify) ).
tff(ax3,axiom,
! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> ! [X4] :
( '$ki_exists_in_world_$i'(X1,X4)
=> ? [X8] :
( '$ki_exists_in_world_$i'(X1,X8)
& ! [X7: '$ki_world'] :
( '$ki_accessible'(X1,X7)
=> ( ( bomb(X7,X4)
& h(X7,X8) )
=> defused(X7,X4) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax3) ).
tff('$ki_exists_in_world_$i_const',axiom,
! [X1: '$ki_world',X4] : '$ki_exists_in_world_$i'(X1,X4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','$ki_exists_in_world_$i_const') ).
tff(mrel_reflexive,axiom,
! [X1: '$ki_world'] : '$ki_accessible'(X1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mrel_reflexive) ).
tff(c_0_4,negated_conjecture,
~ ! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> ! [X4] :
( '$ki_exists_in_world_$i'(X1,X4)
=> ? [X8] :
( '$ki_exists_in_world_$i'(X1,X8)
& ( ( bomb(X1,X4)
& h(X1,X8) )
=> defused(X1,X4) ) ) ) ),
inference(assume_negation,[status(cth)],[verify]) ).
tff(c_0_5,plain,
! [X12: '$ki_world',X13,X15: '$ki_world'] :
( ( '$ki_exists_in_world_$i'(X12,esk3_2(X12,X13))
| ~ '$ki_exists_in_world_$i'(X12,X13)
| ~ '$ki_accessible'('$ki_local_world',X12) )
& ( ~ '$ki_accessible'(X12,X15)
| ~ bomb(X15,X13)
| ~ h(X15,esk3_2(X12,X13))
| defused(X15,X13)
| ~ '$ki_exists_in_world_$i'(X12,X13)
| ~ '$ki_accessible'('$ki_local_world',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)],[ax3])])])])])]) ).
tff(c_0_6,plain,
! [X22: '$ki_world',X23] : '$ki_exists_in_world_$i'(X22,X23),
inference(variable_rename,[status(thm)],['$ki_exists_in_world_$i_const']) ).
tff(c_0_7,negated_conjecture,
! [X11] :
( '$ki_accessible'('$ki_local_world',esk1_0)
& '$ki_exists_in_world_$i'(esk1_0,esk2_0)
& ( bomb(esk1_0,esk2_0)
| ~ '$ki_exists_in_world_$i'(esk1_0,X11) )
& ( h(esk1_0,X11)
| ~ '$ki_exists_in_world_$i'(esk1_0,X11) )
& ( ~ defused(esk1_0,esk2_0)
| ~ '$ki_exists_in_world_$i'(esk1_0,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_4])])])])])]) ).
tcf(c_0_8,plain,
! [X4,X2: '$ki_world',X1: '$ki_world'] :
( defused(X2,X4)
| ~ '$ki_accessible'(X1,X2)
| ~ bomb(X2,X4)
| ~ h(X2,esk3_2(X1,X4))
| ~ '$ki_exists_in_world_$i'(X1,X4)
| ~ '$ki_accessible'('$ki_local_world',X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
tcf(c_0_9,plain,
! [X1: '$ki_world',X4] : '$ki_exists_in_world_$i'(X1,X4),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
tcf(c_0_10,negated_conjecture,
! [X4] :
( h(esk1_0,X4)
| ~ '$ki_exists_in_world_$i'(esk1_0,X4) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
tcf(c_0_11,plain,
! [X4,X2: '$ki_world',X1: '$ki_world'] :
( defused(X1,X4)
| ~ bomb(X1,X4)
| ~ h(X1,esk3_2(X2,X4))
| ~ '$ki_accessible'('$ki_local_world',X2)
| ~ '$ki_accessible'(X2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9])]) ).
tcf(c_0_12,negated_conjecture,
! [X4] : h(esk1_0,X4),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_9])]) ).
tff(c_0_13,plain,
! [X26: '$ki_world'] : '$ki_accessible'(X26,X26),
inference(variable_rename,[status(thm)],[mrel_reflexive]) ).
tcf(c_0_14,negated_conjecture,
! [X4] :
( ~ defused(esk1_0,esk2_0)
| ~ '$ki_exists_in_world_$i'(esk1_0,X4) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
tcf(c_0_15,negated_conjecture,
! [X4,X1: '$ki_world'] :
( defused(esk1_0,X4)
| ~ bomb(esk1_0,X4)
| ~ '$ki_accessible'('$ki_local_world',X1)
| ~ '$ki_accessible'(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
tcf(c_0_16,plain,
! [X1: '$ki_world'] : '$ki_accessible'(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
tcf(c_0_17,negated_conjecture,
'$ki_accessible'('$ki_local_world',esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
tcf(c_0_18,negated_conjecture,
! [X4] :
( bomb(esk1_0,esk2_0)
| ~ '$ki_exists_in_world_$i'(esk1_0,X4) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
tcf(c_0_19,negated_conjecture,
~ defused(esk1_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_9])]) ).
tcf(c_0_20,negated_conjecture,
! [X4] :
( defused(esk1_0,X4)
| ~ bomb(esk1_0,X4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]) ).
tcf(c_0_21,negated_conjecture,
bomb(esk1_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_9])]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : PLA053_4 : TPTP v8.2.0. Released v8.2.0.
% 0.06/0.13 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n021.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sat May 18 13:33:23 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.46 Running first-order theorem proving
% 0.21/0.46 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.21/0.48 # Version: 3.1.0
% 0.21/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.48 # Starting sh5l with 300s (1) cores
% 0.21/0.48 # new_bool_3 with pid 31119 completed with status 0
% 0.21/0.48 # Result found by new_bool_3
% 0.21/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.48 # Search class: FHHNS-FFSS21-SFFFFFNN
% 0.21/0.48 # partial match(1): FHHNS-FFSF21-SFFFFFNN
% 0.21/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.48 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.48 # SAT001_MinMin_p005000_rr_RG with pid 31123 completed with status 0
% 0.21/0.48 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.48 # Search class: FHHNS-FFSS21-SFFFFFNN
% 0.21/0.48 # partial match(1): FHHNS-FFSF21-SFFFFFNN
% 0.21/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.48 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.48 # Preprocessing time : 0.001 s
% 0.21/0.48 # Presaturation interreduction done
% 0.21/0.48
% 0.21/0.48 # Proof found!
% 0.21/0.48 # SZS status Theorem
% 0.21/0.48 # SZS output start CNFRefutation
% See solution above
% 0.21/0.48 # Parsed axioms : 15
% 0.21/0.48 # Removed by relevancy pruning/SinE : 7
% 0.21/0.48 # Initial clauses : 15
% 0.21/0.48 # Removed in clause preprocessing : 0
% 0.21/0.48 # Initial clauses in saturation : 15
% 0.21/0.48 # Processed clauses : 35
% 0.21/0.48 # ...of these trivial : 3
% 0.21/0.48 # ...subsumed : 2
% 0.21/0.48 # ...remaining for further processing : 30
% 0.21/0.48 # Other redundant clauses eliminated : 0
% 0.21/0.48 # Clauses deleted for lack of memory : 0
% 0.21/0.48 # Backward-subsumed : 1
% 0.21/0.48 # Backward-rewritten : 4
% 0.21/0.48 # Generated clauses : 12
% 0.21/0.48 # ...of the previous two non-redundant : 11
% 0.21/0.48 # ...aggressively subsumed : 0
% 0.21/0.48 # Contextual simplify-reflections : 0
% 0.21/0.48 # Paramodulations : 12
% 0.21/0.48 # Factorizations : 0
% 0.21/0.48 # NegExts : 0
% 0.21/0.48 # Equation resolutions : 0
% 0.21/0.48 # Disequality decompositions : 0
% 0.21/0.48 # Total rewrite steps : 19
% 0.21/0.48 # ...of those cached : 9
% 0.21/0.48 # Propositional unsat checks : 0
% 0.21/0.48 # Propositional check models : 0
% 0.21/0.48 # Propositional check unsatisfiable : 0
% 0.21/0.48 # Propositional clauses : 0
% 0.21/0.48 # Propositional clauses after purity: 0
% 0.21/0.48 # Propositional unsat core size : 0
% 0.21/0.48 # Propositional preprocessing time : 0.000
% 0.21/0.48 # Propositional encoding time : 0.000
% 0.21/0.48 # Propositional solver time : 0.000
% 0.21/0.48 # Success case prop preproc time : 0.000
% 0.21/0.48 # Success case prop encoding time : 0.000
% 0.21/0.48 # Success case prop solver time : 0.000
% 0.21/0.48 # Current number of processed clauses : 15
% 0.21/0.48 # Positive orientable unit clauses : 5
% 0.21/0.48 # Positive unorientable unit clauses: 0
% 0.21/0.48 # Negative unit clauses : 1
% 0.21/0.48 # Non-unit-clauses : 9
% 0.21/0.48 # Current number of unprocessed clauses: 1
% 0.21/0.48 # ...number of literals in the above : 2
% 0.21/0.48 # Current number of archived formulas : 0
% 0.21/0.48 # Current number of archived clauses : 15
% 0.21/0.48 # Clause-clause subsumption calls (NU) : 7
% 0.21/0.48 # Rec. Clause-clause subsumption calls : 5
% 0.21/0.48 # Non-unit clause-clause subsumptions : 3
% 0.21/0.48 # Unit Clause-clause subsumption calls : 0
% 0.21/0.48 # Rewrite failures with RHS unbound : 0
% 0.21/0.48 # BW rewrite match attempts : 5
% 0.21/0.48 # BW rewrite match successes : 3
% 0.21/0.48 # Condensation attempts : 0
% 0.21/0.48 # Condensation successes : 0
% 0.21/0.48 # Termbank termtop insertions : 1278
% 0.21/0.48 # Search garbage collected termcells : 274
% 0.21/0.48
% 0.21/0.48 # -------------------------------------------------
% 0.21/0.48 # User time : 0.006 s
% 0.21/0.48 # System time : 0.000 s
% 0.21/0.48 # Total time : 0.006 s
% 0.21/0.48 # Maximum resident set size: 1696 pages
% 0.21/0.48
% 0.21/0.48 # -------------------------------------------------
% 0.21/0.48 # User time : 0.008 s
% 0.21/0.48 # System time : 0.002 s
% 0.21/0.48 # Total time : 0.010 s
% 0.21/0.48 # Maximum resident set size: 1716 pages
% 0.21/0.48 % E---3.1 exiting
% 0.21/0.48 % E exiting
%------------------------------------------------------------------------------