TSTP Solution File: NLP265_17 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NLP265_17 : TPTP v8.2.0. Released v8.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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:55:47 EDT 2024
% Result : Theorem 0.24s 0.55s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 14
% Syntax : Number of formulae : 23 ( 6 unt; 11 typ; 0 def)
% Number of atoms : 21 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 14 ( 5 ~; 2 |; 2 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 4 ( 2 usr)
% Number of type conns : 5 ( 2 >; 3 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 7 con; 0-0 aty)
% Number of variables : 14 ( 0 sgn 14 !; 0 ?; 14 :)
% 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(b_alice)': '$ki_index' ).
tff(decl_25,type,
'#idx(b_bob)': '$ki_index' ).
tff(decl_27,type,
'#idx(i_alice)': '$ki_index' ).
tff(decl_28,type,
portland: $i ).
tff(decl_29,type,
bigcity: ( '$ki_world' * $i ) > $o ).
tff(decl_30,type,
esk1_0: '$ki_world' ).
tff(decl_31,type,
esk2_0: '$ki_world' ).
tff(verify,conjecture,
! [X1: '$ki_world'] :
( '$ki_accessible'('#idx(i_alice)','$ki_local_world',X1)
=> ! [X3: '$ki_world'] :
( '$ki_accessible'('#idx(b_bob)',X1,X3)
=> bigcity(X3,portland) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',verify) ).
tff(axiom_2,axiom,
! [X1: '$ki_world'] :
( '$ki_accessible'('#idx(b_alice)','$ki_local_world',X1)
=> bigcity(X1,portland) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
tff('mrel_universal_#idx(b_alice)',axiom,
! [X1: '$ki_world',X2: '$ki_world'] : '$ki_accessible'('#idx(b_alice)',X1,X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','mrel_universal_#idx(b_alice)') ).
tff(c_0_3,negated_conjecture,
~ ! [X1: '$ki_world'] :
( '$ki_accessible'('#idx(i_alice)','$ki_local_world',X1)
=> ! [X3: '$ki_world'] :
( '$ki_accessible'('#idx(b_bob)',X1,X3)
=> bigcity(X3,portland) ) ),
inference(assume_negation,[status(cth)],[verify]) ).
tff(c_0_4,plain,
! [X7: '$ki_world'] :
( ~ '$ki_accessible'('#idx(b_alice)','$ki_local_world',X7)
| bigcity(X7,portland) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_2])])]) ).
tff(c_0_5,plain,
! [X19: '$ki_world',X20: '$ki_world'] : '$ki_accessible'('#idx(b_alice)',X19,X20),
inference(variable_rename,[status(thm)],['mrel_universal_#idx(b_alice)']) ).
tff(c_0_6,negated_conjecture,
( '$ki_accessible'('#idx(i_alice)','$ki_local_world',esk1_0)
& '$ki_accessible'('#idx(b_bob)',esk1_0,esk2_0)
& ~ bigcity(esk2_0,portland) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).
tcf(c_0_7,plain,
! [X1: '$ki_world'] :
( bigcity(X1,portland)
| ~ '$ki_accessible'('#idx(b_alice)','$ki_local_world',X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
tcf(c_0_8,plain,
! [X1: '$ki_world',X2: '$ki_world'] : '$ki_accessible'('#idx(b_alice)',X1,X2),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
tcf(c_0_9,negated_conjecture,
~ bigcity(esk2_0,portland),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
tcf(c_0_10,plain,
! [X1: '$ki_world'] : bigcity(X1,portland),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8])]) ).
cnf(c_0_11,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.15 % Problem : NLP265_17 : TPTP v8.2.0. Released v8.2.0.
% 0.08/0.16 % Command : run_E %s %d THM
% 0.16/0.38 % Computer : n029.cluster.edu
% 0.16/0.38 % Model : x86_64 x86_64
% 0.16/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.38 % Memory : 8042.1875MB
% 0.16/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.38 % CPULimit : 300
% 0.16/0.38 % WCLimit : 300
% 0.16/0.38 % DateTime : Sun May 19 22:45:38 EDT 2024
% 0.16/0.38 % CPUTime :
% 0.24/0.53 Running first-order theorem proving
% 0.24/0.53 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.24/0.55 # Version: 3.1.0
% 0.24/0.55 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.24/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.24/0.55 # Starting sh5l with 300s (1) cores
% 0.24/0.55 # new_bool_3 with pid 18641 completed with status 0
% 0.24/0.55 # Result found by new_bool_3
% 0.24/0.55 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.24/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.24/0.55 # Search class: FGHNS-FFSF11-SFFFFFNN
% 0.24/0.55 # partial match(1): FGHNF-FFSF11-SFFFFFNN
% 0.24/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.55 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.24/0.55 # SAT001_MinMin_p005000_rr_RG with pid 18646 completed with status 0
% 0.24/0.55 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.24/0.55 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.24/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.24/0.55 # Search class: FGHNS-FFSF11-SFFFFFNN
% 0.24/0.55 # partial match(1): FGHNF-FFSF11-SFFFFFNN
% 0.24/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.55 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.24/0.55 # Preprocessing time : 0.001 s
% 0.24/0.55 # Presaturation interreduction done
% 0.24/0.55
% 0.24/0.55 # Proof found!
% 0.24/0.55 # SZS status Theorem
% 0.24/0.55 # SZS output start CNFRefutation
% See solution above
% 0.24/0.55 # Parsed axioms : 19
% 0.24/0.55 # Removed by relevancy pruning/SinE : 12
% 0.24/0.55 # Initial clauses : 11
% 0.24/0.55 # Removed in clause preprocessing : 0
% 0.24/0.55 # Initial clauses in saturation : 11
% 0.24/0.55 # Processed clauses : 7
% 0.24/0.55 # ...of these trivial : 0
% 0.24/0.55 # ...subsumed : 0
% 0.24/0.55 # ...remaining for further processing : 7
% 0.24/0.55 # Other redundant clauses eliminated : 0
% 0.24/0.55 # Clauses deleted for lack of memory : 0
% 0.24/0.55 # Backward-subsumed : 0
% 0.24/0.55 # Backward-rewritten : 3
% 0.24/0.55 # Generated clauses : 0
% 0.24/0.55 # ...of the previous two non-redundant : 0
% 0.24/0.55 # ...aggressively subsumed : 0
% 0.24/0.55 # Contextual simplify-reflections : 0
% 0.24/0.55 # Paramodulations : 0
% 0.24/0.55 # Factorizations : 0
% 0.24/0.55 # NegExts : 0
% 0.24/0.55 # Equation resolutions : 0
% 0.24/0.55 # Disequality decompositions : 0
% 0.24/0.55 # Total rewrite steps : 4
% 0.24/0.55 # ...of those cached : 0
% 0.24/0.55 # Propositional unsat checks : 0
% 0.24/0.55 # Propositional check models : 0
% 0.24/0.55 # Propositional check unsatisfiable : 0
% 0.24/0.55 # Propositional clauses : 0
% 0.24/0.55 # Propositional clauses after purity: 0
% 0.24/0.55 # Propositional unsat core size : 0
% 0.24/0.55 # Propositional preprocessing time : 0.000
% 0.24/0.55 # Propositional encoding time : 0.000
% 0.24/0.55 # Propositional solver time : 0.000
% 0.24/0.55 # Success case prop preproc time : 0.000
% 0.24/0.55 # Success case prop encoding time : 0.000
% 0.24/0.55 # Success case prop solver time : 0.000
% 0.24/0.55 # Current number of processed clauses : 4
% 0.24/0.55 # Positive orientable unit clauses : 4
% 0.24/0.55 # Positive unorientable unit clauses: 0
% 0.24/0.55 # Negative unit clauses : 0
% 0.24/0.55 # Non-unit-clauses : 0
% 0.24/0.55 # Current number of unprocessed clauses: 4
% 0.24/0.55 # ...number of literals in the above : 21
% 0.24/0.55 # Current number of archived formulas : 0
% 0.24/0.55 # Current number of archived clauses : 3
% 0.24/0.55 # Clause-clause subsumption calls (NU) : 0
% 0.24/0.55 # Rec. Clause-clause subsumption calls : 0
% 0.24/0.55 # Non-unit clause-clause subsumptions : 0
% 0.24/0.55 # Unit Clause-clause subsumption calls : 0
% 0.24/0.55 # Rewrite failures with RHS unbound : 0
% 0.24/0.55 # BW rewrite match attempts : 3
% 0.24/0.55 # BW rewrite match successes : 3
% 0.24/0.55 # Condensation attempts : 0
% 0.24/0.55 # Condensation successes : 0
% 0.24/0.55 # Termbank termtop insertions : 830
% 0.24/0.55 # Search garbage collected termcells : 192
% 0.24/0.55
% 0.24/0.55 # -------------------------------------------------
% 0.24/0.55 # User time : 0.002 s
% 0.24/0.55 # System time : 0.003 s
% 0.24/0.55 # Total time : 0.006 s
% 0.24/0.55 # Maximum resident set size: 1712 pages
% 0.24/0.55
% 0.24/0.55 # -------------------------------------------------
% 0.24/0.55 # User time : 0.004 s
% 0.24/0.55 # System time : 0.005 s
% 0.24/0.55 # Total time : 0.010 s
% 0.24/0.55 # Maximum resident set size: 1708 pages
% 0.24/0.55 % E---3.1 exiting
% 0.24/0.55 % E exiting
%------------------------------------------------------------------------------