TSTP Solution File: SYO906_7 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYO906_7 : TPTP v8.2.0. Released v8.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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:50:36 EDT 2024
% Result : CounterSatisfiable 0.18s 0.47s
% Output : Saturation 0.18s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_3)
% Comments :
%------------------------------------------------------------------------------
tcf(c_0_5,negated_conjecture,
! [X1: '$ki_world',X2,X4] :
( '$ki_accessible'('$ki_local_world',esk6_1(X2))
| '$ki_accessible'('$ki_local_world',esk5_1(X2))
| f(X1,X4)
| ~ '$ki_exists_in_world_$i'('$ki_local_world',X2)
| ~ '$ki_accessible'('$ki_local_world',X1)
| ~ '$ki_exists_in_world_$i'(X1,X4)
| ~ g(X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_6,plain,
! [X1: '$ki_world'] : '$ki_exists_in_world_$i'(X1,esk1_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_4]),
[final] ).
tcf(c_0_7,negated_conjecture,
! [X1: '$ki_world',X2,X4] :
( f(esk6_1(X2),X2)
| '$ki_accessible'('$ki_local_world',esk5_1(X2))
| f(X1,X4)
| ~ '$ki_exists_in_world_$i'('$ki_local_world',X2)
| ~ '$ki_accessible'('$ki_local_world',X1)
| ~ '$ki_exists_in_world_$i'(X1,X4)
| ~ g(X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_8,negated_conjecture,
! [X1: '$ki_world',X2,X4] :
( f(esk6_1(X2),X2)
| f(X1,X4)
| ~ g(esk5_1(X2),X2)
| ~ '$ki_exists_in_world_$i'('$ki_local_world',X2)
| ~ '$ki_accessible'('$ki_local_world',X1)
| ~ '$ki_exists_in_world_$i'(X1,X4)
| ~ g(X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_9,negated_conjecture,
! [X1: '$ki_world'] :
( g(X1,esk4_0)
| '$ki_exists_in_world_$i'(esk2_0,esk3_0)
| ~ '$ki_accessible'('$ki_local_world',X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_10,negated_conjecture,
( '$ki_exists_in_world_$i'('$ki_local_world',esk4_0)
| '$ki_exists_in_world_$i'(esk2_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_11,negated_conjecture,
! [X1: '$ki_world'] :
( g(X1,esk4_0)
| '$ki_accessible'('$ki_local_world',esk2_0)
| ~ '$ki_accessible'('$ki_local_world',X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_12,negated_conjecture,
( '$ki_exists_in_world_$i'('$ki_local_world',esk4_0)
| '$ki_accessible'('$ki_local_world',esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_13,negated_conjecture,
! [X1: '$ki_world',X2,X4] :
( '$ki_accessible'('$ki_local_world',esk6_1(X2))
| f(X1,X4)
| ~ g(esk5_1(X2),X2)
| ~ '$ki_exists_in_world_$i'('$ki_local_world',X2)
| ~ '$ki_accessible'('$ki_local_world',X1)
| ~ '$ki_exists_in_world_$i'(X1,X4)
| ~ g(X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_14,negated_conjecture,
! [X2,X1: '$ki_world'] :
( f(X1,X2)
| '$ki_accessible'('$ki_local_world',esk6_1(esk1_1('$ki_local_world')))
| '$ki_accessible'('$ki_local_world',esk5_1(esk1_1('$ki_local_world')))
| ~ '$ki_exists_in_world_$i'(X1,X2)
| ~ g(X1,X2)
| ~ '$ki_accessible'('$ki_local_world',X1) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]),
[final] ).
tcf(c_0_15,negated_conjecture,
! [X2,X1: '$ki_world'] :
( f(esk6_1(esk1_1('$ki_local_world')),esk1_1('$ki_local_world'))
| f(X1,X2)
| '$ki_accessible'('$ki_local_world',esk5_1(esk1_1('$ki_local_world')))
| ~ '$ki_exists_in_world_$i'(X1,X2)
| ~ g(X1,X2)
| ~ '$ki_accessible'('$ki_local_world',X1) ),
inference(spm,[status(thm)],[c_0_7,c_0_6]),
[final] ).
tcf(c_0_16,negated_conjecture,
! [X2,X1: '$ki_world'] :
( '$ki_exists_in_world_$i'(esk2_0,esk3_0)
| f(esk6_1(esk4_0),esk4_0)
| f(X1,X2)
| ~ '$ki_exists_in_world_$i'(X1,X2)
| ~ g(X1,X2)
| ~ '$ki_accessible'('$ki_local_world',X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_7]),c_0_10]),
[final] ).
tcf(c_0_17,negated_conjecture,
! [X2,X1: '$ki_world'] :
( f(esk6_1(esk4_0),esk4_0)
| f(X1,X2)
| '$ki_accessible'('$ki_local_world',esk2_0)
| ~ '$ki_exists_in_world_$i'(X1,X2)
| ~ g(X1,X2)
| ~ '$ki_accessible'('$ki_local_world',X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_11]),c_0_7]),c_0_12]),
[final] ).
tcf(c_0_18,negated_conjecture,
! [X2,X1: '$ki_world'] :
( '$ki_exists_in_world_$i'(esk2_0,esk3_0)
| f(X1,X2)
| '$ki_accessible'('$ki_local_world',esk6_1(esk4_0))
| ~ '$ki_exists_in_world_$i'(X1,X2)
| ~ g(X1,X2)
| ~ '$ki_accessible'('$ki_local_world',X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_9]),c_0_5]),c_0_10]),
[final] ).
tcf(c_0_19,negated_conjecture,
! [X2,X1: '$ki_world'] :
( f(X1,X2)
| '$ki_accessible'('$ki_local_world',esk6_1(esk4_0))
| '$ki_accessible'('$ki_local_world',esk2_0)
| ~ '$ki_exists_in_world_$i'(X1,X2)
| ~ g(X1,X2)
| ~ '$ki_accessible'('$ki_local_world',X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_11]),c_0_5]),c_0_12]),
[final] ).
tcf(c_0_20,negated_conjecture,
! [X1: '$ki_world'] :
( g(X1,esk4_0)
| g(esk2_0,esk3_0)
| ~ '$ki_accessible'('$ki_local_world',X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_21,negated_conjecture,
! [X1: '$ki_world'] :
( g(X1,esk4_0)
| ~ '$ki_accessible'('$ki_local_world',X1)
| ~ f(esk2_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_22,negated_conjecture,
! [X1: '$ki_world'] :
( '$ki_exists_in_world_$i'(esk2_0,esk3_0)
| ~ '$ki_accessible'('$ki_local_world',X1)
| ~ f(X1,esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_23,negated_conjecture,
! [X1: '$ki_world'] :
( g(esk2_0,esk3_0)
| ~ '$ki_accessible'('$ki_local_world',X1)
| ~ f(X1,esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_24,negated_conjecture,
( '$ki_exists_in_world_$i'('$ki_local_world',esk4_0)
| g(esk2_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_25,negated_conjecture,
! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',esk2_0)
| ~ '$ki_accessible'('$ki_local_world',X1)
| ~ f(X1,esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_26,negated_conjecture,
! [X1: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X1)
| ~ f(X1,esk4_0)
| ~ f(esk2_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_27,negated_conjecture,
( '$ki_exists_in_world_$i'('$ki_local_world',esk4_0)
| ~ f(esk2_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SYO906_7 : TPTP v8.2.0. Released v8.2.0.
% 0.10/0.12 % Command : run_E %s %d THM
% 0.13/0.33 % Computer : n022.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Mon May 20 09:56:23 EDT 2024
% 0.13/0.33 % CPUTime :
% 0.18/0.46 Running first-order theorem proving
% 0.18/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.18/0.47 # Version: 3.1.0
% 0.18/0.47 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.18/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.18/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.47 # Starting sh5l with 300s (1) cores
% 0.18/0.47 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 5884 completed with status 1
% 0.18/0.47 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.18/0.47 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.18/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.18/0.47 # No SInE strategy applied
% 0.18/0.47 # Search class: FGHNF-FFSS11-SFFFFFNN
% 0.18/0.47 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.47 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.18/0.47 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.18/0.47 # Starting new_bool_3 with 136s (1) cores
% 0.18/0.47 # Starting new_bool_1 with 136s (1) cores
% 0.18/0.47 # Starting sh5l with 136s (1) cores
% 0.18/0.47 # SAT001_MinMin_p005000_rr_RG with pid 5888 completed with status 1
% 0.18/0.47 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.18/0.47 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.18/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.18/0.47 # No SInE strategy applied
% 0.18/0.47 # Search class: FGHNF-FFSS11-SFFFFFNN
% 0.18/0.47 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.47 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.18/0.47 # Preprocessing time : 0.001 s
% 0.18/0.47 # Presaturation interreduction done
% 0.18/0.47
% 0.18/0.47 # No proof found!
% 0.18/0.47 # SZS status CounterSatisfiable
% 0.18/0.47 # SZS output start Saturation
% See solution above
% 0.18/0.47 # Parsed axioms : 8
% 0.18/0.47 # Removed by relevancy pruning/SinE : 0
% 0.18/0.47 # Initial clauses : 23
% 0.18/0.47 # Removed in clause preprocessing : 6
% 0.18/0.47 # Initial clauses in saturation : 17
% 0.18/0.47 # Processed clauses : 42
% 0.18/0.47 # ...of these trivial : 0
% 0.18/0.47 # ...subsumed : 2
% 0.18/0.47 # ...remaining for further processing : 40
% 0.18/0.47 # Other redundant clauses eliminated : 0
% 0.18/0.47 # Clauses deleted for lack of memory : 0
% 0.18/0.47 # Backward-subsumed : 0
% 0.18/0.47 # Backward-rewritten : 0
% 0.18/0.47 # Generated clauses : 8
% 0.18/0.47 # ...of the previous two non-redundant : 8
% 0.18/0.47 # ...aggressively subsumed : 0
% 0.18/0.47 # Contextual simplify-reflections : 8
% 0.18/0.47 # Paramodulations : 8
% 0.18/0.47 # Factorizations : 0
% 0.18/0.47 # NegExts : 0
% 0.18/0.47 # Equation resolutions : 0
% 0.18/0.47 # Disequality decompositions : 0
% 0.18/0.47 # Total rewrite steps : 0
% 0.18/0.47 # ...of those cached : 0
% 0.18/0.47 # Propositional unsat checks : 0
% 0.18/0.47 # Propositional check models : 0
% 0.18/0.47 # Propositional check unsatisfiable : 0
% 0.18/0.47 # Propositional clauses : 0
% 0.18/0.47 # Propositional clauses after purity: 0
% 0.18/0.47 # Propositional unsat core size : 0
% 0.18/0.47 # Propositional preprocessing time : 0.000
% 0.18/0.47 # Propositional encoding time : 0.000
% 0.18/0.47 # Propositional solver time : 0.000
% 0.18/0.47 # Success case prop preproc time : 0.000
% 0.18/0.47 # Success case prop encoding time : 0.000
% 0.18/0.47 # Success case prop solver time : 0.000
% 0.18/0.47 # Current number of processed clauses : 23
% 0.18/0.47 # Positive orientable unit clauses : 1
% 0.18/0.47 # Positive unorientable unit clauses: 0
% 0.18/0.47 # Negative unit clauses : 0
% 0.18/0.47 # Non-unit-clauses : 22
% 0.18/0.47 # Current number of unprocessed clauses: 0
% 0.18/0.47 # ...number of literals in the above : 0
% 0.18/0.47 # Current number of archived formulas : 0
% 0.18/0.47 # Current number of archived clauses : 17
% 0.18/0.47 # Clause-clause subsumption calls (NU) : 43
% 0.18/0.47 # Rec. Clause-clause subsumption calls : 12
% 0.18/0.47 # Non-unit clause-clause subsumptions : 10
% 0.18/0.47 # Unit Clause-clause subsumption calls : 5
% 0.18/0.47 # Rewrite failures with RHS unbound : 0
% 0.18/0.47 # BW rewrite match attempts : 0
% 0.18/0.47 # BW rewrite match successes : 0
% 0.18/0.47 # Condensation attempts : 0
% 0.18/0.47 # Condensation successes : 0
% 0.18/0.47 # Termbank termtop insertions : 2042
% 0.18/0.47 # Search garbage collected termcells : 264
% 0.18/0.47
% 0.18/0.47 # -------------------------------------------------
% 0.18/0.47 # User time : 0.005 s
% 0.18/0.47 # System time : 0.002 s
% 0.18/0.47 # Total time : 0.008 s
% 0.18/0.47 # Maximum resident set size: 1760 pages
% 0.18/0.47
% 0.18/0.47 # -------------------------------------------------
% 0.18/0.47 # User time : 0.028 s
% 0.18/0.47 # System time : 0.004 s
% 0.18/0.47 # Total time : 0.032 s
% 0.18/0.47 # Maximum resident set size: 1708 pages
% 0.18/0.47 % E---3.1 exiting
% 0.18/0.48 % E exiting
%------------------------------------------------------------------------------