TSTP Solution File: SYO911_15 by E-SAT---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.2.0
% Problem : SYO911_15 : TPTP v8.2.0. Released v8.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d SAT
% Computer : n027.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 : Mon Jun 24 20:43:28 EDT 2024
% Result : CounterSatisfiable 0.20s 0.51s
% Output : Saturation 0.20s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_3)
% Comments :
%------------------------------------------------------------------------------
tcf(c_0_4,negated_conjecture,
! [X1: '$ki_world',X2: '$ki_world',X3: '$ki_world',X4: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X1)
| ~ p(X1)
| ~ '$ki_accessible'(X1,X2)
| ~ q(X2)
| ~ '$ki_accessible'('$ki_local_world',X3)
| ~ p(X3)
| ~ '$ki_accessible'('$ki_local_world',X4)
| ~ q(X4) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_5,negated_conjecture,
( '$ki_accessible'('$ki_local_world',esk5_0)
| '$ki_accessible'(esk2_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_6,negated_conjecture,
( '$ki_accessible'('$ki_local_world',esk5_0)
| '$ki_accessible'('$ki_local_world',esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_7,negated_conjecture,
( '$ki_accessible'('$ki_local_world',esk5_0)
| p(esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_8,negated_conjecture,
( '$ki_accessible'('$ki_local_world',esk5_0)
| q(esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_9,negated_conjecture,
( '$ki_accessible'('$ki_local_world',esk4_0)
| '$ki_accessible'(esk2_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_10,negated_conjecture,
( '$ki_accessible'('$ki_local_world',esk4_0)
| '$ki_accessible'('$ki_local_world',esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_11,negated_conjecture,
( '$ki_accessible'('$ki_local_world',esk4_0)
| p(esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_12,negated_conjecture,
( '$ki_accessible'('$ki_local_world',esk4_0)
| q(esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_13,negated_conjecture,
( q(esk5_0)
| '$ki_accessible'('$ki_local_world',esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_15,negated_conjecture,
! [X1: '$ki_world',X2: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',esk5_0)
| ~ q(X1)
| ~ p(X2)
| ~ '$ki_accessible'('$ki_local_world',X1)
| ~ '$ki_accessible'('$ki_local_world',X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_5]),c_0_6]),c_0_7]),c_0_8]),
[final] ).
tcf(c_0_16,negated_conjecture,
! [X1: '$ki_world',X2: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',esk4_0)
| ~ q(X1)
| ~ p(X2)
| ~ '$ki_accessible'('$ki_local_world',X1)
| ~ '$ki_accessible'('$ki_local_world',X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_9]),c_0_10]),c_0_11]),c_0_12]),
[final] ).
tcf(c_0_18,plain,
! [X1: '$ki_world'] : '$ki_accessible'(X1,esk1_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_14]),
[final] ).
tcf(c_0_21,negated_conjecture,
! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',esk2_0)
| ~ p('$ki_local_world')
| ~ p(X1)
| ~ '$ki_accessible'('$ki_local_world','$ki_local_world')
| ~ '$ki_accessible'('$ki_local_world',X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_13]),c_0_6]),
[final] ).
tcf(c_0_22,negated_conjecture,
! [X3: '$ki_world',X2: '$ki_world',X1: '$ki_world'] :
( ~ q(esk1_1(X1))
| ~ q(X2)
| ~ p(X3)
| ~ p(X1)
| ~ '$ki_accessible'('$ki_local_world',X2)
| ~ '$ki_accessible'('$ki_local_world',X3)
| ~ '$ki_accessible'('$ki_local_world',X1) ),
inference(spm,[status(thm)],[c_0_4,c_0_18]),
[final] ).
tcf(c_0_23,negated_conjecture,
( '$ki_accessible'('$ki_local_world',esk5_0)
| ~ '$ki_accessible'('$ki_local_world',esk3_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_7]),c_0_6]),
[final] ).
tcf(c_0_24,negated_conjecture,
( '$ki_accessible'('$ki_local_world',esk4_0)
| ~ '$ki_accessible'('$ki_local_world',esk3_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_11]),c_0_10]),
[final] ).
tcf(c_0_25,negated_conjecture,
( q(esk5_0)
| '$ki_accessible'(esk2_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_26,negated_conjecture,
( p(esk4_0)
| '$ki_accessible'(esk2_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_27,negated_conjecture,
( p(esk4_0)
| '$ki_accessible'('$ki_local_world',esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_28,negated_conjecture,
( q(esk5_0)
| q(esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_29,negated_conjecture,
( p(esk4_0)
| q(esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_30,negated_conjecture,
( q(esk5_0)
| p(esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_31,negated_conjecture,
( p(esk4_0)
| p(esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYO911_15 : TPTP v8.2.0. Released v8.2.0.
% 0.07/0.12 % Command : run_E %s %d SAT
% 0.13/0.34 % Computer : n027.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 : Sun Jun 23 10:12:54 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.49 Running first-order model finding
% 0.20/0.49 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/tmp/tmp.79ZCIIXOlY/E---3.1_23788.p
% 0.20/0.51 # Version: 3.2.0
% 0.20/0.51 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.51 # Starting sh5l with 300s (1) cores
% 0.20/0.51 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 23878 completed with status 1
% 0.20/0.51 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.20/0.51 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.51 # No SInE strategy applied
% 0.20/0.51 # Search class: FGHNF-FFSM11-SFFFFFNN
% 0.20/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.20/0.51 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.20/0.51 # Starting new_bool_3 with 136s (1) cores
% 0.20/0.51 # Starting new_bool_1 with 136s (1) cores
% 0.20/0.51 # Starting sh5l with 136s (1) cores
% 0.20/0.51 # SAT001_MinMin_p005000_rr_RG with pid 23884 completed with status 1
% 0.20/0.51 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.51 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.51 # No SInE strategy applied
% 0.20/0.51 # Search class: FGHNF-FFSM11-SFFFFFNN
% 0.20/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.20/0.51 # Preprocessing time : 0.001 s
% 0.20/0.51 # Presaturation interreduction done
% 0.20/0.51
% 0.20/0.51 # No proof found!
% 0.20/0.51 # SZS status CounterSatisfiable
% 0.20/0.51 # SZS output start Saturation
% See solution above
% 0.20/0.51 # Parsed axioms : 7
% 0.20/0.51 # Removed by relevancy pruning/SinE : 0
% 0.20/0.51 # Initial clauses : 23
% 0.20/0.51 # Removed in clause preprocessing : 5
% 0.20/0.51 # Initial clauses in saturation : 18
% 0.20/0.51 # Processed clauses : 55
% 0.20/0.51 # ...of these trivial : 0
% 0.20/0.51 # ...subsumed : 10
% 0.20/0.51 # ...remaining for further processing : 45
% 0.20/0.51 # Other redundant clauses eliminated : 0
% 0.20/0.51 # Clauses deleted for lack of memory : 0
% 0.20/0.51 # Backward-subsumed : 3
% 0.20/0.51 # Backward-rewritten : 0
% 0.20/0.51 # Generated clauses : 36
% 0.20/0.51 # ...of the previous two non-redundant : 30
% 0.20/0.51 # ...aggressively subsumed : 0
% 0.20/0.51 # Contextual simplify-reflections : 10
% 0.20/0.51 # Paramodulations : 36
% 0.20/0.51 # Factorizations : 0
% 0.20/0.51 # NegExts : 0
% 0.20/0.51 # Equation resolutions : 0
% 0.20/0.51 # Disequality decompositions : 0
% 0.20/0.51 # Total rewrite steps : 0
% 0.20/0.51 # ...of those cached : 0
% 0.20/0.51 # Propositional unsat checks : 0
% 0.20/0.51 # Propositional check models : 0
% 0.20/0.51 # Propositional check unsatisfiable : 0
% 0.20/0.51 # Propositional clauses : 0
% 0.20/0.51 # Propositional clauses after purity: 0
% 0.20/0.51 # Propositional unsat core size : 0
% 0.20/0.51 # Propositional preprocessing time : 0.000
% 0.20/0.51 # Propositional encoding time : 0.000
% 0.20/0.51 # Propositional solver time : 0.000
% 0.20/0.51 # Success case prop preproc time : 0.000
% 0.20/0.51 # Success case prop encoding time : 0.000
% 0.20/0.51 # Success case prop solver time : 0.000
% 0.20/0.51 # Current number of processed clauses : 24
% 0.20/0.51 # Positive orientable unit clauses : 1
% 0.20/0.51 # Positive unorientable unit clauses: 0
% 0.20/0.51 # Negative unit clauses : 0
% 0.20/0.51 # Non-unit-clauses : 23
% 0.20/0.51 # Current number of unprocessed clauses: 0
% 0.20/0.51 # ...number of literals in the above : 0
% 0.20/0.51 # Current number of archived formulas : 0
% 0.20/0.51 # Current number of archived clauses : 21
% 0.20/0.51 # Clause-clause subsumption calls (NU) : 43
% 0.20/0.51 # Rec. Clause-clause subsumption calls : 27
% 0.20/0.51 # Non-unit clause-clause subsumptions : 23
% 0.20/0.51 # Unit Clause-clause subsumption calls : 0
% 0.20/0.51 # Rewrite failures with RHS unbound : 0
% 0.20/0.51 # BW rewrite match attempts : 0
% 0.20/0.51 # BW rewrite match successes : 0
% 0.20/0.51 # Condensation attempts : 0
% 0.20/0.51 # Condensation successes : 0
% 0.20/0.51 # Termbank termtop insertions : 1757
% 0.20/0.51 # Search garbage collected termcells : 175
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.004 s
% 0.20/0.51 # System time : 0.004 s
% 0.20/0.51 # Total time : 0.008 s
% 0.20/0.51 # Maximum resident set size: 1704 pages
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.021 s
% 0.20/0.51 # System time : 0.010 s
% 0.20/0.51 # Total time : 0.030 s
% 0.20/0.51 # Maximum resident set size: 1688 pages
% 0.20/0.51 % E---3.1 exiting
% 0.20/0.51 % E exiting
%------------------------------------------------------------------------------