TSTP Solution File: LCL962_16 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : LCL962_16 : TPTP v8.2.0. Released v8.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n012.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 00:04:15 EDT 2024
% Result : Theorem 0.17s 0.49s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 14
% Syntax : Number of formulae : 33 ( 12 unt; 9 typ; 0 def)
% Number of atoms : 56 ( 0 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 59 ( 27 ~; 21 |; 2 &)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 5 ( 3 >; 2 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-1 aty)
% Number of variables : 22 ( 0 sgn 22 !; 0 ?; 22 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_sort1,type,
'$ki_world': $tType ).
tff(decl_sort2,type,
'$ki_index': $tType ).
tff(decl_22,type,
'$ki_local_world': '$ki_world' ).
tff(decl_23,type,
'$ki_accessible': ( '$ki_index' * '$ki_world' * '$ki_world' ) > $o ).
tff(decl_24,type,
'#idx(a)': '$ki_index' ).
tff(decl_25,type,
'#idx(b)': '$ki_index' ).
tff(decl_26,type,
p: '$ki_world' > $o ).
tff(decl_27,type,
esk1_0: '$ki_world' ).
tff(decl_28,type,
esk2_1: '$ki_world' > '$ki_world' ).
tff(verify,conjecture,
! [X1: '$ki_world'] :
( '$ki_accessible'('#idx(a)','$ki_local_world',X1)
=> ~ p(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',verify) ).
tff(ab_axiom_2,axiom,
( ~ ! [X1: '$ki_world'] :
( '$ki_accessible'('#idx(b)','$ki_local_world',X1)
=> p(X1) )
=> ! [X1: '$ki_world'] :
( '$ki_accessible'('#idx(a)','$ki_local_world',X1)
=> ~ ! [X4: '$ki_world'] :
( '$ki_accessible'('#idx(b)',X1,X4)
=> p(X4) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ab_axiom_2) ).
tff(not_a_axiom_1,axiom,
~ p('$ki_local_world'),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_a_axiom_1) ).
tff('mrel_reflexive_#idx(b)',axiom,
! [X1: '$ki_world'] : '$ki_accessible'('#idx(b)',X1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','mrel_reflexive_#idx(b)') ).
tff(ab_axiom_1,axiom,
! [X1: '$ki_world'] :
( '$ki_accessible'('#idx(a)','$ki_local_world',X1)
=> ( p(X1)
=> ! [X4: '$ki_world'] :
( '$ki_accessible'('#idx(b)',X1,X4)
=> p(X4) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ab_axiom_1) ).
tff(c_0_5,negated_conjecture,
~ ! [X1: '$ki_world'] :
( '$ki_accessible'('#idx(a)','$ki_local_world',X1)
=> ~ p(X1) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[verify])]) ).
tff(c_0_6,plain,
! [X8: '$ki_world',X9: '$ki_world'] :
( ( '$ki_accessible'('#idx(b)',X9,esk2_1(X9))
| ~ '$ki_accessible'('#idx(a)','$ki_local_world',X9)
| ~ '$ki_accessible'('#idx(b)','$ki_local_world',X8)
| p(X8) )
& ( ~ p(esk2_1(X9))
| ~ '$ki_accessible'('#idx(a)','$ki_local_world',X9)
| ~ '$ki_accessible'('#idx(b)','$ki_local_world',X8)
| p(X8) ) ),
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)],[ab_axiom_2])])])])])]) ).
tff(c_0_7,negated_conjecture,
( '$ki_accessible'('#idx(a)','$ki_local_world',esk1_0)
& p(esk1_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
tff(c_0_8,plain,
~ p('$ki_local_world'),
inference(fof_simplification,[status(thm)],[not_a_axiom_1]) ).
tcf(c_0_9,plain,
! [X1: '$ki_world',X2: '$ki_world'] :
( '$ki_accessible'('#idx(b)',X1,esk2_1(X1))
| p(X2)
| ~ '$ki_accessible'('#idx(a)','$ki_local_world',X1)
| ~ '$ki_accessible'('#idx(b)','$ki_local_world',X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
tcf(c_0_10,negated_conjecture,
'$ki_accessible'('#idx(a)','$ki_local_world',esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
tff(c_0_11,plain,
! [X15: '$ki_world'] : '$ki_accessible'('#idx(b)',X15,X15),
inference(variable_rename,[status(thm)],['mrel_reflexive_#idx(b)']) ).
tff(c_0_12,plain,
~ p('$ki_local_world'),
inference(fof_nnf,[status(thm)],[c_0_8]) ).
tff(c_0_13,plain,
! [X6: '$ki_world',X7: '$ki_world'] :
( ~ '$ki_accessible'('#idx(a)','$ki_local_world',X6)
| ~ p(X6)
| ~ '$ki_accessible'('#idx(b)',X6,X7)
| p(X7) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ab_axiom_1])])])]) ).
tcf(c_0_14,negated_conjecture,
! [X1: '$ki_world'] :
( p(X1)
| '$ki_accessible'('#idx(b)',esk1_0,esk2_1(esk1_0))
| ~ '$ki_accessible'('#idx(b)','$ki_local_world',X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
tcf(c_0_15,plain,
! [X1: '$ki_world'] : '$ki_accessible'('#idx(b)',X1,X1),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
tcf(c_0_16,plain,
~ p('$ki_local_world'),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
tcf(c_0_17,plain,
! [X1: '$ki_world',X2: '$ki_world'] :
( p(X2)
| ~ '$ki_accessible'('#idx(a)','$ki_local_world',X1)
| ~ p(X1)
| ~ '$ki_accessible'('#idx(b)',X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
tcf(c_0_18,negated_conjecture,
'$ki_accessible'('#idx(b)',esk1_0,esk2_1(esk1_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
tcf(c_0_19,negated_conjecture,
p(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
tcf(c_0_20,plain,
! [X1: '$ki_world',X2: '$ki_world'] :
( p(X2)
| ~ p(esk2_1(X1))
| ~ '$ki_accessible'('#idx(a)','$ki_local_world',X1)
| ~ '$ki_accessible'('#idx(b)','$ki_local_world',X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
tcf(c_0_21,negated_conjecture,
p(esk2_1(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_10])]) ).
tcf(c_0_22,negated_conjecture,
! [X1: '$ki_world'] :
( p(X1)
| ~ '$ki_accessible'('#idx(b)','$ki_local_world',X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_10])]) ).
cnf(c_0_23,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_22]),c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : LCL962_16 : TPTP v8.2.0. Released v8.2.0.
% 0.10/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n012.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon May 20 01:32:38 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.17/0.47 Running first-order model finding
% 0.17/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.17/0.49 # Version: 3.1.0
% 0.17/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.49 # Starting sh5l with 300s (1) cores
% 0.17/0.49 # sh5l with pid 15161 completed with status 0
% 0.17/0.49 # Result found by sh5l
% 0.17/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.49 # Starting sh5l with 300s (1) cores
% 0.17/0.49 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.17/0.49 # Search class: FGUNS-FFSF11-SFFFFFNN
% 0.17/0.49 # partial match(1): FGUNF-FFSF11-SFFFFFNN
% 0.17/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.49 # Starting SAT001_CO_MinMin_p005000_rr with 181s (1) cores
% 0.17/0.49 # SAT001_CO_MinMin_p005000_rr with pid 15163 completed with status 0
% 0.17/0.49 # Result found by SAT001_CO_MinMin_p005000_rr
% 0.17/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.49 # Starting sh5l with 300s (1) cores
% 0.17/0.49 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.17/0.49 # Search class: FGUNS-FFSF11-SFFFFFNN
% 0.17/0.49 # partial match(1): FGUNF-FFSF11-SFFFFFNN
% 0.17/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.49 # Starting SAT001_CO_MinMin_p005000_rr with 181s (1) cores
% 0.17/0.49 # Preprocessing time : 0.001 s
% 0.17/0.49 # Presaturation interreduction done
% 0.17/0.49
% 0.17/0.49 # Proof found!
% 0.17/0.49 # SZS status Theorem
% 0.17/0.49 # SZS output start CNFRefutation
% See solution above
% 0.17/0.49 # Parsed axioms : 15
% 0.17/0.49 # Removed by relevancy pruning/SinE : 7
% 0.17/0.49 # Initial clauses : 10
% 0.17/0.49 # Removed in clause preprocessing : 0
% 0.17/0.49 # Initial clauses in saturation : 10
% 0.17/0.49 # Processed clauses : 31
% 0.17/0.49 # ...of these trivial : 0
% 0.17/0.49 # ...subsumed : 3
% 0.17/0.49 # ...remaining for further processing : 28
% 0.17/0.49 # Other redundant clauses eliminated : 0
% 0.17/0.49 # Clauses deleted for lack of memory : 0
% 0.17/0.49 # Backward-subsumed : 2
% 0.17/0.49 # Backward-rewritten : 2
% 0.17/0.49 # Generated clauses : 18
% 0.17/0.49 # ...of the previous two non-redundant : 14
% 0.17/0.49 # ...aggressively subsumed : 0
% 0.17/0.49 # Contextual simplify-reflections : 0
% 0.17/0.49 # Paramodulations : 18
% 0.17/0.49 # Factorizations : 0
% 0.17/0.49 # NegExts : 0
% 0.17/0.49 # Equation resolutions : 0
% 0.17/0.49 # Disequality decompositions : 0
% 0.17/0.49 # Total rewrite steps : 8
% 0.17/0.49 # ...of those cached : 2
% 0.17/0.49 # Propositional unsat checks : 0
% 0.17/0.49 # Propositional check models : 0
% 0.17/0.49 # Propositional check unsatisfiable : 0
% 0.17/0.49 # Propositional clauses : 0
% 0.17/0.49 # Propositional clauses after purity: 0
% 0.17/0.49 # Propositional unsat core size : 0
% 0.17/0.49 # Propositional preprocessing time : 0.000
% 0.17/0.49 # Propositional encoding time : 0.000
% 0.17/0.49 # Propositional solver time : 0.000
% 0.17/0.49 # Success case prop preproc time : 0.000
% 0.17/0.49 # Success case prop encoding time : 0.000
% 0.17/0.49 # Success case prop solver time : 0.000
% 0.17/0.49 # Current number of processed clauses : 14
% 0.17/0.49 # Positive orientable unit clauses : 7
% 0.17/0.49 # Positive unorientable unit clauses: 0
% 0.17/0.49 # Negative unit clauses : 1
% 0.17/0.49 # Non-unit-clauses : 6
% 0.17/0.49 # Current number of unprocessed clauses: 3
% 0.17/0.49 # ...number of literals in the above : 6
% 0.17/0.49 # Current number of archived formulas : 0
% 0.17/0.49 # Current number of archived clauses : 14
% 0.17/0.49 # Clause-clause subsumption calls (NU) : 15
% 0.17/0.49 # Rec. Clause-clause subsumption calls : 14
% 0.17/0.49 # Non-unit clause-clause subsumptions : 4
% 0.17/0.49 # Unit Clause-clause subsumption calls : 0
% 0.17/0.49 # Rewrite failures with RHS unbound : 0
% 0.17/0.49 # BW rewrite match attempts : 5
% 0.17/0.49 # BW rewrite match successes : 2
% 0.17/0.49 # Condensation attempts : 31
% 0.17/0.49 # Condensation successes : 0
% 0.17/0.49 # Termbank termtop insertions : 1164
% 0.17/0.49 # Search garbage collected termcells : 144
% 0.17/0.49
% 0.17/0.49 # -------------------------------------------------
% 0.17/0.49 # User time : 0.004 s
% 0.17/0.49 # System time : 0.001 s
% 0.17/0.49 # Total time : 0.006 s
% 0.17/0.49 # Maximum resident set size: 1764 pages
% 0.17/0.49
% 0.17/0.49 # -------------------------------------------------
% 0.17/0.49 # User time : 0.004 s
% 0.17/0.49 # System time : 0.005 s
% 0.17/0.49 # Total time : 0.009 s
% 0.17/0.49 # Maximum resident set size: 1712 pages
% 0.17/0.49 % E---3.1 exiting
%------------------------------------------------------------------------------