TSTP Solution File: PLA053_15 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : PLA053_15 : TPTP v8.2.0. Released v8.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n014.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:41 EDT 2024
% Result : CounterSatisfiable 0.20s 0.49s
% Output : Saturation 0.20s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_12)
% Comments :
%------------------------------------------------------------------------------
tcf(c_0_10,plain,
! [X1: '$ki_world',X3,X2: '$ki_world'] :
( '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_exists_in_world_$i'(X1,X3)
| ~ '$ki_accessible'(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]),
[final] ).
tcf(c_0_11,negated_conjecture,
'$ki_accessible'('$ki_local_world',esk6_0),
inference(split_conjunct,[status(thm)],[c_0_9]),
[final] ).
tcf(c_0_14,negated_conjecture,
! [X3] :
( '$ki_exists_in_world_$i'(esk6_0,X3)
| ~ '$ki_exists_in_world_$i'('$ki_local_world',X3) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]),
[final] ).
tcf(c_0_15,plain,
'$ki_exists_in_world_$i'('$ki_local_world',esk4_0),
inference(split_conjunct,[status(thm)],[c_0_12]),
[final] ).
tcf(c_0_16,plain,
! [X3,X2: '$ki_world',X1: '$ki_world'] :
( defused(X2,X3)
| ~ '$ki_accessible'(X1,X2)
| ~ bomb(X2,X3)
| ~ h(X2,esk5_2(X1,X3))
| ~ '$ki_exists_in_world_$i'(X1,X3)
| ~ '$ki_accessible'('$ki_local_world',X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]),
[final] ).
tcf(c_0_17,negated_conjecture,
! [X3] :
( h(esk6_0,X3)
| ~ '$ki_exists_in_world_$i'(esk6_0,X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]),
[final] ).
tcf(c_0_18,plain,
! [X3,X1: '$ki_world'] :
( '$ki_exists_in_world_$i'(X1,esk5_2(X1,X3))
| ~ '$ki_exists_in_world_$i'(X1,X3)
| ~ '$ki_accessible'('$ki_local_world',X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]),
[final] ).
tcf(c_0_20,plain,
! [X1: '$ki_world',X3,X2: '$ki_world'] :
( bomb(X2,X3)
| ~ '$ki_accessible'('$ki_local_world',X1)
| ~ '$ki_exists_in_world_$i'(X1,X3)
| ~ bomb(X1,X3)
| ~ h(X1,esk4_0)
| ~ '$ki_accessible'(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]),
[final] ).
tcf(c_0_21,negated_conjecture,
'$ki_exists_in_world_$i'(esk6_0,esk4_0),
inference(spm,[status(thm)],[c_0_14,c_0_15]),
[final] ).
tcf(c_0_23,negated_conjecture,
! [X3,X1: '$ki_world'] :
( defused(esk6_0,X3)
| ~ '$ki_exists_in_world_$i'(esk6_0,esk5_2(X1,X3))
| ~ '$ki_exists_in_world_$i'(X1,X3)
| ~ bomb(esk6_0,X3)
| ~ '$ki_accessible'('$ki_local_world',X1)
| ~ '$ki_accessible'(X1,esk6_0) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]),
[final] ).
tcf(c_0_24,negated_conjecture,
! [X3] :
( '$ki_exists_in_world_$i'(esk6_0,esk5_2('$ki_local_world',X3))
| ~ '$ki_exists_in_world_$i'('$ki_local_world',X3)
| ~ '$ki_accessible'('$ki_local_world','$ki_local_world') ),
inference(spm,[status(thm)],[c_0_14,c_0_18]),
[final] ).
tcf(c_0_26,plain,
! [X1: '$ki_world'] : '$ki_exists_in_world_$i'(X1,esk2_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_19]),
[final] ).
tcf(c_0_28,negated_conjecture,
! [X3,X1: '$ki_world'] :
( bomb(X1,X3)
| ~ '$ki_exists_in_world_$i'(esk6_0,X3)
| ~ bomb(esk6_0,X3)
| ~ '$ki_accessible'(esk6_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_17]),c_0_11]),c_0_21])]),
[final] ).
tcf(c_0_29,plain,
! [X1: '$ki_world'] :
( bomb(X1,esk3_1(X1))
| ~ '$ki_accessible'('$ki_local_world',X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]),
[final] ).
tcf(c_0_30,negated_conjecture,
! [X3] :
( ~ defused(esk6_0,esk7_0)
| ~ '$ki_exists_in_world_$i'(esk6_0,X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]),
[final] ).
tcf(c_0_31,negated_conjecture,
! [X3] :
( defused(esk6_0,X3)
| ~ '$ki_exists_in_world_$i'('$ki_local_world',X3)
| ~ bomb(esk6_0,X3)
| ~ '$ki_accessible'('$ki_local_world','$ki_local_world') ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_11])]),
[final] ).
tcf(c_0_32,negated_conjecture,
bomb(esk6_0,esk7_0),
inference(spm,[status(thm)],[c_0_25,c_0_26]),
[final] ).
tcf(c_0_34,negated_conjecture,
'$ki_exists_in_world_$i'(esk6_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_9]),
[final] ).
tcf(c_0_35,plain,
! [X1: '$ki_world'] :
( '$ki_exists_in_world_$i'(X1,esk3_1(X1))
| ~ '$ki_accessible'('$ki_local_world',X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]),
[final] ).
tcf(c_0_36,plain,
! [X1: '$ki_world'] : '$ki_accessible'(X1,esk1_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_27]),
[final] ).
tcf(c_0_37,negated_conjecture,
! [X1: '$ki_world'] :
( bomb(X1,esk3_1(esk6_0))
| ~ '$ki_exists_in_world_$i'(esk6_0,esk3_1(esk6_0))
| ~ '$ki_accessible'(esk6_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_11])]),
[final] ).
tcf(c_0_38,negated_conjecture,
! [X3] :
( ~ '$ki_exists_in_world_$i'('$ki_local_world',esk7_0)
| ~ '$ki_exists_in_world_$i'(esk6_0,X3)
| ~ '$ki_accessible'('$ki_local_world','$ki_local_world') ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32])]),
[final] ).
tcf(c_0_39,negated_conjecture,
! [X3] :
( ~ '$ki_exists_in_world_$i'(esk6_0,X3)
| ~ '$ki_accessible'(esk6_0,esk6_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_33]),c_0_34]),c_0_32])]),
[final] ).
tcf(c_0_40,negated_conjecture,
! [X1: '$ki_world'] :
( bomb(X1,esk7_0)
| ~ '$ki_accessible'(esk6_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_32]),c_0_34])]),
[final] ).
tcf(c_0_41,negated_conjecture,
( '$ki_exists_in_world_$i'(esk6_0,esk3_1('$ki_local_world'))
| ~ '$ki_accessible'('$ki_local_world','$ki_local_world') ),
inference(spm,[status(thm)],[c_0_14,c_0_35]),
[final] ).
tcf(c_0_42,plain,
! [X1: '$ki_world',X3] :
( '$ki_exists_in_world_$i'(esk1_1(X1),X3)
| ~ '$ki_exists_in_world_$i'(X1,X3) ),
inference(spm,[status(thm)],[c_0_10,c_0_36]),
[final] ).
tcf(c_0_43,negated_conjecture,
'$ki_exists_in_world_$i'(esk6_0,esk2_1('$ki_local_world')),
inference(spm,[status(thm)],[c_0_14,c_0_26]),
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : PLA053_15 : TPTP v8.2.0. Released v8.2.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n014.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 : Sat May 18 13:46:38 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running first-order model finding
% 0.20/0.47 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.49 # Version: 3.1.0
% 0.20/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.49 # Starting sh5l with 300s (1) cores
% 0.20/0.49 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 32003 completed with status 1
% 0.20/0.49 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.49 # No SInE strategy applied
% 0.20/0.49 # Search class: FHHNS-FFSS21-SFFFFFNN
% 0.20/0.49 # partial match(1): FHHNS-FFSF21-SFFFFFNN
% 0.20/0.49 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.20/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.20/0.49 # Starting new_bool_3 with 136s (1) cores
% 0.20/0.49 # Starting new_bool_1 with 136s (1) cores
% 0.20/0.49 # Starting sh5l with 136s (1) cores
% 0.20/0.49 # SAT001_MinMin_p005000_rr_RG with pid 32007 completed with status 1
% 0.20/0.49 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.49 # No SInE strategy applied
% 0.20/0.49 # Search class: FHHNS-FFSS21-SFFFFFNN
% 0.20/0.49 # partial match(1): FHHNS-FFSF21-SFFFFFNN
% 0.20/0.49 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.20/0.49 # Preprocessing time : 0.001 s
% 0.20/0.49 # Presaturation interreduction done
% 0.20/0.49
% 0.20/0.49 # No proof found!
% 0.20/0.49 # SZS status CounterSatisfiable
% 0.20/0.49 # SZS output start Saturation
% See solution above
% 0.20/0.49 # Parsed axioms : 14
% 0.20/0.49 # Removed by relevancy pruning/SinE : 0
% 0.20/0.49 # Initial clauses : 21
% 0.20/0.49 # Removed in clause preprocessing : 7
% 0.20/0.49 # Initial clauses in saturation : 14
% 0.20/0.49 # Processed clauses : 45
% 0.20/0.49 # ...of these trivial : 0
% 0.20/0.49 # ...subsumed : 2
% 0.20/0.49 # ...remaining for further processing : 43
% 0.20/0.49 # Other redundant clauses eliminated : 0
% 0.20/0.49 # Clauses deleted for lack of memory : 0
% 0.20/0.49 # Backward-subsumed : 1
% 0.20/0.49 # Backward-rewritten : 1
% 0.20/0.49 # Generated clauses : 18
% 0.20/0.49 # ...of the previous two non-redundant : 18
% 0.20/0.49 # ...aggressively subsumed : 0
% 0.20/0.49 # Contextual simplify-reflections : 0
% 0.20/0.49 # Paramodulations : 18
% 0.20/0.49 # Factorizations : 0
% 0.20/0.49 # NegExts : 0
% 0.20/0.49 # Equation resolutions : 0
% 0.20/0.49 # Disequality decompositions : 0
% 0.20/0.49 # Total rewrite steps : 11
% 0.20/0.49 # ...of those cached : 7
% 0.20/0.49 # Propositional unsat checks : 0
% 0.20/0.49 # Propositional check models : 0
% 0.20/0.49 # Propositional check unsatisfiable : 0
% 0.20/0.49 # Propositional clauses : 0
% 0.20/0.49 # Propositional clauses after purity: 0
% 0.20/0.49 # Propositional unsat core size : 0
% 0.20/0.49 # Propositional preprocessing time : 0.000
% 0.20/0.49 # Propositional encoding time : 0.000
% 0.20/0.49 # Propositional solver time : 0.000
% 0.20/0.49 # Success case prop preproc time : 0.000
% 0.20/0.49 # Success case prop encoding time : 0.000
% 0.20/0.49 # Success case prop solver time : 0.000
% 0.20/0.49 # Current number of processed clauses : 27
% 0.20/0.49 # Positive orientable unit clauses : 8
% 0.20/0.49 # Positive unorientable unit clauses: 0
% 0.20/0.49 # Negative unit clauses : 0
% 0.20/0.49 # Non-unit-clauses : 19
% 0.20/0.49 # Current number of unprocessed clauses: 0
% 0.20/0.49 # ...number of literals in the above : 0
% 0.20/0.49 # Current number of archived formulas : 0
% 0.20/0.49 # Current number of archived clauses : 16
% 0.20/0.49 # Clause-clause subsumption calls (NU) : 78
% 0.20/0.49 # Rec. Clause-clause subsumption calls : 43
% 0.20/0.49 # Non-unit clause-clause subsumptions : 3
% 0.20/0.49 # Unit Clause-clause subsumption calls : 1
% 0.20/0.49 # Rewrite failures with RHS unbound : 0
% 0.20/0.49 # BW rewrite match attempts : 1
% 0.20/0.49 # BW rewrite match successes : 1
% 0.20/0.49 # Condensation attempts : 0
% 0.20/0.49 # Condensation successes : 0
% 0.20/0.49 # Termbank termtop insertions : 1662
% 0.20/0.49 # Search garbage collected termcells : 275
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.004 s
% 0.20/0.49 # System time : 0.005 s
% 0.20/0.49 # Total time : 0.009 s
% 0.20/0.49 # Maximum resident set size: 1768 pages
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.017 s
% 0.20/0.49 # System time : 0.011 s
% 0.20/0.49 # Total time : 0.028 s
% 0.20/0.49 # Maximum resident set size: 1716 pages
% 0.20/0.49 % E---3.1 exiting
%------------------------------------------------------------------------------